Elliptic curve cryptography

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Elliptic curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC requires smaller keys compared to non-ECC cryptography (based on plain Galois fields) to provide equivalent security.[1]

Elliptic curves are applicable for encryption, digital signatures, pseudo-random generators and other tasks. They are also used in several integer factorization algorithms that have applications in cryptography, such as Lenstra elliptic curve factorization.



The primary benefit promised by elliptic curve cryptography is a smaller key size, reducing storage and transmission requirements, i.e. that an elliptic curve group could provide the same level of security afforded by an RSA-based system with a large modulus and correspondingly larger key: for example, a 256-bit elliptic curve public key should provide comparable security to a 3072-bit RSA public key.

The U.S. National Institute of Standards and Technology (NIST) has endorsed elliptic curve cryptography in its Suite B set of recommended algorithms, specifically elliptic curve Diffie–Hellman (ECDH) for key exchange and Elliptic Curve Digital Signature Algorithm (ECDSA) for digital signature. The U.S. National Security Agency (NSA) allows their use for protecting information classified up to top secret with 384-bit keys.[2] However, in August 2015, the NSA announced that it plans to replace Suite B with a new cipher suite due to concerns about quantum computing attacks on ECC.[3]

While the RSA patent expired in 2000, there may be patents in force covering certain aspects of ECC technology, though some (including RSA Laboratories[4] and Daniel J. Bernstein[5]) argue that the US government elliptic curve digital signature standard (ECDSA; NIST FIPS 186-3) and certain practical ECC-based key exchange schemes (including ECDH) can be implemented without infringing them.


The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[6] and Victor S. Miller[7] in 1985. Elliptic curve cryptography algorithms entered wide use in 2004 to 2005.





Cryptographic schemes[edit]

Several discrete logarithm-based protocols have been adapted to elliptic curves, replacing the group with an elliptic curve:




Some common implementation considerations include:

Domain parameters[edit]

To use ECC, all parties must agree on all the elements defining the elliptic curve, that is, the domain parameters of the scheme. The field is defined by p in the prime case and the pair of m and f in the binary case. The elliptic curve is defined by the constants a and b used in its defining equation. Finally, the cyclic subgroup is defined by its generator (a.k.a. base point) G. For cryptographic application the order of G, that is the smallest positive number n such that , is normally prime. Since n is the size of a subgroup of it follows from Lagrange's theorem that the number is an integer. In cryptographic applications this number h, called the cofactor, must be small () and, preferably, . To summarize: in the prime case, the domain parameters are ; in the binary case, they are .


The generation of domain parameters is not usually done by each participant because this involves computing the number of points on a curve which is time-consuming and troublesome to implement. As a result, several standard bodies published domain parameters of elliptic curves for several common field sizes. Such domain parameters are commonly known as "standard curves" or "named curves"; a named curve can be referenced either by name or by the unique object identifier defined in the standard documents:

SECG test vectors are also available.[9] NIST has approved many SECG curves, so there is a significant overlap between the specifications published by NIST and SECG. EC domain parameters may be either specified by value or by name.


  • Select the number of points and generate a curve with this number of points using complex multiplication technique.[10]

Several classes of curves are weak and should be avoided:

  • Curves over with non-prime m are vulnerable to Weil descent attacks.[11][12]
  • Curves such that n divides (where p is the characteristic of the field – q for a prime field, or for a binary field) for sufficiently small B are vulnerable to Menezes–Okamoto–Vanstone (MOV) attack[13][14] which applies usual Discrete Logarithm Problem (DLP) in a small degree extension field of to solve ECDLP. The bound B should be chosen so that discrete logarithms in the field are at least as difficult to compute as discrete logs on the elliptic curve .[15]
  • Curves such that are vulnerable to the attack that maps the points on the curve to the additive group of [16][17][18]

Key sizes[edit]

Because all the fastest known algorithms that allow one to solve the ECDLP (baby-step giant-step, Pollard's rho, etc.), need steps, it follows that the size of the underlying field should be roughly twice the security parameter. For example, for 128-bit security one needs a curve over , where . This can be contrasted with finite-field cryptography (e.g., DSA) which requires[19] 3072-bit public keys and 256-bit private keys, and integer factorization cryptography (e.g., RSA) which requires a 3072-bit value of n, where the private key should be just as large. However the public key may be smaller to accommodate efficient encryption, especially when processing power is limited.

The hardest ECC scheme (publicly) broken to date had a 112-bit key for the prime field case and a 109-bit key for the binary field case. For the prime field case, this was broken in July 2009 using a cluster of over 200 PlayStation 3 game consoles and could have been finished in 3.5 months using this cluster when running continuously.[20] The binary field case was broken in April 2004 using 2600 computers over 17 months.[21]


Projective coordinates[edit]

A close examination of the addition rules shows that in order to add two points, one needs not only several additions and multiplications in but also an inversion operation. The inversion (for given find such that ) is one to two orders of magnitude slower[23] than multiplication. Fortunately, points on a curve can be represented in different coordinate systems which do not require an inversion operation to add two points. Several such systems were proposed: in the projective system each point is represented by three coordinates using the following relation: , ; in the Jacobian system a point is also represented with three coordinates , but a different relation is used: , ; in the López–Dahab system the relation is , ; in the modified Jacobian system the same relations are used but four coordinates are stored and used for calculations ; and in the Chudnovsky Jacobian system five coordinates are used . Note that there may be different naming conventions, for example, IEEE P1363-2000 standard uses "projective coordinates" to refer to what is commonly called Jacobian coordinates. An additional speed-up is possible if mixed coordinates are used.[24]

Fast reduction (NIST curves)[edit]

Reduction modulo p (which is needed for addition and multiplication) can be executed much faster if the prime p is a pseudo-Mersenne prime, that is ; for example, or Compared to Barrett reduction, there can be an order of magnitude speed-up.[25] The speed-up here is a practical rather than theoretical one, and derives from the fact that the moduli of numbers against numbers near powers of two can be performed efficiently by computers operating on binary numbers with bitwise operations.

The curves over with pseudo-Mersenne p are recommended by NIST. Yet another advantage of the NIST curves is that they use a = −3, which improves addition in Jacobian coordinates.

According to Bernstein and Lange, many of the efficiency-related decisions in NIST FIPS 186-2 are sub-optimal. Other curves are more secure and run just as fast.[26]



In 1999, NIST recommended 15 elliptic curves.[citation needed] Specifically, FIPS 186-3 has 10 recommended finite fields:

  • Five prime fields for certain primes p of sizes 192, 224, 256, 384, and 521[27] bits. For each of the prime fields, one elliptic curve is recommended.

The NIST recommendation thus contains a total of 5 prime curves and 10 binary curves. The curves were ostensibly chosen for optimal security and implementation efficiency.[28]

In 2013, the New York Times stated that Dual Elliptic Curve Deterministic Random Bit Generation (or Dual_EC_DRBG) had been included as a NIST national standard due to the influence of NSA, which had included a deliberate weakness in the algorithm and the recommended elliptic curve. RSA Security in September 2013 issued an advisory recommending that its customers discontinue using any software based on Dual_EC_DRBG.[29][30] In the wake of the exposure of Dual_EC_DRBG as "an NSA undercover operation", cryptography experts have also expressed concern over the security of the NIST recommended elliptic curves,[31] suggesting a return to encryption based on non-elliptic-curve groups.


Side-channel attacks[edit]

Unlike most other DLP systems (where it is possible to use the same procedure for squaring and multiplication), the EC addition is significantly different for doubling (P = Q) and general addition (PQ) depending on the coordinate system used. Consequently, it is important to counteract side channel attacks (e.g., timing or simple/differential power analysis attacks) using, for example, fixed pattern window (a.k.a. comb) methods[clarification needed][32] (note that this does not increase computation time). Alternatively one can use an Edwards curve; this is a special family of elliptic curves for which doubling and addition can be done with the same operation.[33] Another concern for ECC-systems is the danger of fault attacks, especially when running on smart cards.[34]


Cryptographic experts have expressed concerns that the National Security Agency has inserted a kleptographic backdoor into at least one elliptic curve-based pseudo random generator.[35] Internal memos leaked by former NSA contractor, Edward Snowden, suggest that the NSA put a backdoor in the Dual_EC_DRBG standard.[36] One analysis of the possible backdoor concluded that an adversary in possession of the algorithm's secret key could obtain encryption keys given only 32 bytes of ciphertext.[37]

The SafeCurves project has been launched in order to catalog curves that are easy to securely implement and are designed in a fully publicly verifiable way to minimize the chance of a backdoor.[38]

Quantum computing attacks[edit]

In contrast with its current standing over RSA, elliptic curve cryptography is expected to be more vulnerable to an attack based on Shor's algorithm.[39] In theory, making a practical attack feasible many years before an attack on an equivalently secure RSA scheme is possible.[40] This is because smaller elliptic curve keys are needed to match the classical security of RSA. The work of Proos and Zalka show how a quantum computer for breaking 2048-bit RSA requires roughly 4096 qubits, while a quantum computer to break the equivalently secure 224-bit Elliptic Curve Cryptography requires between 1300 and 1600 qubits.

To avoid quantum computing concerns, an elliptic curve-based alternative to Elliptic Curve Diffie Hellman which is not susceptible to Shor's attack is the Supersingular Isogeny Diffie–Hellman Key Exchange of De Feo, Jao and Plut. It uses elliptic curve isogenies to create a drop-in replacement for the quantum attackable Diffie–Hellman and Elliptic curve Diffie–Hellman key exchanges. This key exchange uses the same elliptic curve computational primitives of existing elliptic curve cryptography and requires computational and transmission overhead similar to many currently used public key systems.[41]

In August, 2015, NSA announced that it planned to transition "in the not distant future" to a new cipher suite that is resistant to quantum attacks. "Unfortunately, the growth of elliptic curve use has bumped up against the fact of continued progress in the research on quantum computing, necessitating a re-evaluation of our cryptographic strategy."[3]


Main article: ECC patents


Alternative representations[edit]

Alternative representations of elliptic curves include:

See also[edit]


  2. ^ "Fact Sheet NSA Suite B Cryptography". U.S. National Security Agency. Archived from the original on 2009-02-07. 
  3. ^ a b https://www.nsa.gov/ia/programs/suiteb_cryptography/index.shtml
  4. ^ RSA Laboratories. "6.3.4 Are elliptic curve cryptosystems patented?". Retrieved 15 December 2014. 
  6. ^ Koblitz, N. (1987). "Elliptic curve cryptosystems". Mathematics of Computation. 48 (177): 203–209. doi:10.2307/2007884. JSTOR 2007884. 
  7. ^ Miller, V. (1985). "Use of elliptic curves in cryptography". CRYPTO. Lecture Notes in Computer Science. 85: 417–426. doi:10.1007/3-540-39799-X_31. ISBN 978-3-540-16463-0. 
  8. ^ "The Case for Elliptic Curve Cryptography". NSA. 
  10. ^ Lay, G.; Zimmer, H. (1994). "Constructing elliptic curves with given group order over large finite fields". Algorithmic Number Theory Symposium. Lecture Notes in Computer Science. 877: 250–263. doi:10.1007/3-540-58691-1_64. 
  11. ^ Galbraith, S. D.; Smart, N. P. (1999). "A cryptographic application of the Weil descent". Cryptography and Coding. Lecture Notes in Computer Science. 1746: 799. doi:10.1007/3-540-46665-7_23. 
  12. ^ Gaudry, P.; Hess, F.; Smart, N. P. (2000). "Constructive and destructive facets of Weil descent on elliptic curves" (PDF). Hewlett Packard Laboratories Technical Report. 
  13. ^ Menezes, A.; Okamoto, T.; Vanstone, S. A. (1993). "Reducing elliptic curve logarithms to logarithms in a finite field". IEEE Transactions on Information Theory. 39: 1639–1646. doi:10.1109/18.259647. 
  14. ^ Hitt, L. (2006). "On an Improved Definition of Embedding Degree". IACR ePrint report. 415. 
  15. ^ IEEE P1363, section A.12.1
  16. ^ Semaev, I. (1998). "Evaluation of discrete logarithm in a group of p-torsion points of an elliptic curve in characteristic p". Mathematics of Computation. 67 (221): 353–356. doi:10.1090/S0025-5718-98-00887-4. 
  17. ^ Smart, N. (1999). "The discrete logarithm problem on elliptic curves of trace one". Journal of Cryptology. 12 (3): 193–196. doi:10.1007/s001459900052. 
  20. ^ http://lacal.epfl.ch/page81774.html
  21. ^ "Certicom Announces Elliptic Curve Cryptography Challenge Winner". Certicom. April 27, 2004. Archived from the original on 2011-07-19. 
  22. ^ http://www.ecc-challenge.info/
  23. ^ Hitchcock, Y.; Dawson, E.; Clark, A.; Montague, P. (2002). "Implementing an efficient elliptic curve cryptosystem over GF(p) on a smart card" (PDF). ANZIAM Journal. 44. Archived from the original (PDF) on 2006-03-27. 
  24. ^ Cohen, H.; Miyaji, A.; Ono, T. (1998). "Efficient Elliptic Curve Exponentiation Using Mixed Coordinates". Advances in Cryptology – AsiaCrypt '98. Lecture Notes in Computer Science. 1514: 51–65. doi:10.1007/3-540-49649-1_6. ISBN 978-3-540-65109-3. 
  26. ^ Daniel J. Bernstein and Tanja Lange. "SafeCurves: choosing safe curves for elliptic-curve cryptography". Retrieved 1 December 2013. 
  28. ^ FIPS PUB 186-3, Digital Signature Standard (DSS).
  33. ^ http://blog.cr.yp.to/20140323-ecdsa.html
  34. ^ See, for example, Biehl, Ingrid; Meyer, Bernd; Müller, Volker (2000). "Differential Fault Attacks on Elliptic Curve Cryptosystems". Advances in Cryptology – CRYPTO 2000. Lecture Notes in Computer Science. 1880: 131–146. doi:10.1007/3-540-44598-6_8. ISBN 978-3-540-67907-3. 
  35. ^ https://www.schneier.com/essay-198.html
  36. ^ "Government Announces Steps to Restore Confidence on Encryption Standards". NY Times - Bits Blog. Retrieved 2015-11-06. 
  37. ^ http://rump2007.cr.yp.to/15-shumow.pdf
  38. ^ Bernstein, Daniel J.; Lange, Tanja. "SafeCurves: choosing safe curves for elliptic-curve cryptography". Retrieved October 1, 2016. 
  39. ^ Michael A. Nielsen; Isaac L. Chuang (9 December 2010). Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press. pp. 202–. ISBN 978-1-139-49548-6. 
  40. ^ Proos, John; Zalka. "Shor's discrete logarithm quantum algorithm for elliptic curves". QIC. arXiv:quantph/0301141Freely accessible. Archived from the original on 2004. Retrieved 3 May 2014. 


External links[edit]