Lecture Notes in Computer Science
DOI: 10.1007/3-540-39799-x_31
|View full text |Cite
|
Sign up to set email alerts
|

Use of Elliptic Curves in Cryptography

Abstract: We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% Faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
1,599
0
32

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 2,930 publications
(1,633 citation statements)
references
References 12 publications
2
1,599
0
32
Order By: Relevance
“…The legitimacy of new node joined the network could be confirmed. In [12], the ECC encryption algorithm was introduced. The algorithm used elliptic curve on the mathematical problems to complete the asymmetric encryption.…”
Section: Related Workmentioning
confidence: 99%
“…The legitimacy of new node joined the network could be confirmed. In [12], the ECC encryption algorithm was introduced. The algorithm used elliptic curve on the mathematical problems to complete the asymmetric encryption.…”
Section: Related Workmentioning
confidence: 99%
“…There are a number of challenges with using encryption in small devices. Performing public key encryption on 8-bit microcontrollers has been enhanced by the use of Elliptic Curve Cryptography (ECC) (Koblitz, 1987;Miller, 1986). ECC reduces the time and power requirements for the same level of encryption as an equivalent Rivest, Shamir, and Adleman public key cryptography (RSA) public-key encryption (Rivest, Shamir & Adleman, 1978) by an order of magnitude (Gura et al, 2004;Sethi, Arkko & Keranen, 2012): RSA encryption on constrained 8-bit microcontrollers may take minutes to complete, whereas similar ECC-based cryptography completes in seconds.…”
Section: B1: Network Confidentialitymentioning
confidence: 99%
“…At the receiver, the message is decrypted by the point multiplication result of Alice's public key and Bob's private key . Since that (3) Bob can decode the message without knowing prior knowledge of Alice's private key. Meanwhile the illegal eavesdropper Eve possesses neither of the private keys; she is unable to decrypt the message only with the public keys, due to the hardness to solve Discrete Logarithm Problem.…”
Section: Problem Formulation and Related Workmentioning
confidence: 99%
“…Elliptic Curve Cryptography is first introduced by Miller [3] and Koblitz [4], based on the Discrete Logarithm Problem [5]. With short-length key, ECC can achieve the same security as RSA [1], [6] In hardware implementation, ECC algorithm has smaller capacity, faster computation and less power consumption [7], which will bring benefit in wireless communications and portable devices [8].…”
mentioning
confidence: 99%