Scribd
Upload
2 views2 pages

NSC 2

The document discusses the application of Elliptic Curve Cryptography (ECC) in protocols like Diffie-Hellman and ECDSA, highlighting its efficiency and use in cryptocurrencies and online applications. It also covers RSA encryption, its foundational role in modern cryptography, the various attack vectors it faces, and the importance of key size and security practices. The conclusion emphasizes the need for robust security measures to maintain the integrity of RSA encryption.

Uploaded by

amritsarmajha95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views2 pages

NSC 2

The document discusses the application of Elliptic Curve Cryptography (ECC) in protocols like Diffie-Hellman and ECDSA, highlighting its efficiency and use in cryptocurrencies and online applications. It also covers RSA encryption, its foundational role in modern cryptography, the various attack vectors it faces, and the importance of key size and security practices. The conclusion emphasizes the need for robust security measures to maintain the integrity of RSA encryption.

Uploaded by

amritsarmajha95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Application of Elliptic Curve Cryptography

 Diffie-Hellman: The basic public-key cryptosystem suggested for secret key sharing is the Diffie-
Hellman protocol. If A (Alice) and B (Bob) initially agree on a given curve, field size, and
mathematical type. They then distribute the secret key in the following manner. We can see that all
we need to build the Diffie-Hellman protocol is scalar multiplication.
 Elliptic Curve Digital Signature Algorithm (ECDSA): ECC is one of the most widely utilized digital
signature implementation approaches in cryptocurrencies. In order to sign transactions, both
Bitcoin and Ethereum use the field inverse multiplication, but also arithmetic multiplication, inverse
function, and modular operation.
 Online application: Moreover, ECC is not limited to cryptocurrencies. It is an encryption standard
that will be utilized by most online apps in the future due to its reduced key size and efficiency.
Most commonly used in cryptocurrencies such as Bitcoin and Ethereum, along with single-way
encryption of emails, data, and software.
 Blockchain application: The cryptocurrency Bitcoin employs elliptic curve cryptography. Ethereum
2.0 makes heavy use of elliptic curve pairs with BLS signatures, as stated in the IETF proposed BLS
specification, to cryptographically ensure that a specific Eth2 validator has really verified a specific
transaction
Rivest-Shamir-Adleman (RSA) encryption is a foundational element of modern cryptography, crucial for securing data
transmission over the internet. Developed by Rivest, Shamir, and Adleman, RSA relies on the mathematical difficulty
of factoring large prime numbers, making it a robust public-key cryptosystem. It’s widely used in applications like
HTTPS, email encryption, and digital signatures, ensuring privacy and data integrity.

Despite its strength, RSA is vulnerable to various attack vectors, including plain text attacks, chosen cipher attacks,
factorization attacks, and key-related vulnerabilities. Understanding these potential threats is essential for
maintaining effective RSA encryption.

Security of RSA

These are explained as follows.

1. Plain text attacks:


It is classified into 3 subcategories:-

 Short message attack: In this, we assume that the attacker knows some blocks of plain text and tries to
decode cipher text with the help of that. So, to prevent this pad the plain text before encrypting.

 Cycling attack: In this attack, the attacker thinks that the cipher text has been generated by using some
permutation. He uses all possible permutations of plain text to decipher the cipher text by ‘cycling’ the
permutations.

 Unconcealed Message attack: Sometimes it happens that plain text is the same as cipher text after
encryption. So it must be checked or it will be of no use as the attacker will see right through it.

2. Chosen cipher attack:


In this attacker is able to find out plain text based on cipher text using the Extended Euclidean Algorithm.

3. Factorization attack:
If the attacker is able to know P and Q using N, then he can find out value of private key. This fails when N contains at
least 300 longer digits in decimal terms, attacker will not able to find it. Hence this is infeasible for larger numbers.

In RSA, choosing a small value for the public key or encryption key 𝐸 can create vulnerabilities that attackers might
4. Vulnerabilities Due to Encryption Key Choices:

exploit. While larger values for E improve security, using a small 𝐸 can lead to potential attacks on the encryption
scheme. To ensure better security, a larger value for 𝐸 is recommended. A commonly suggested value is 216 + 1 =
65537 or a value close to this number.

5. Attacks on Decryption key:

 Revealed decryption exponent attack:


If attacker somehow guess decryption key D, not only the cipher text generated by encryption the plain text
with corresponding encryption key is in danger, but even future messages are also in danger. So, it is advised
to take fresh values of two prime numbers (i.e.: P and Q), N and E.

 Low decryption exponent attack:


If we take smaller value of D in RSA this may occur so to avoid this take value of D = 216+1(at least).

Conclusion:

RSA Despite its robustness, RSA faces challenges from various attack methods. Key factors in maintaining RSA’s
security include using sufficiently large key sizes, implementing proper padding schemes, and regularly updating
cryptographic practices. Understanding these security aspects is crucial for implementing strong encryption systems
and advancing the field of cryptography.

You might also like