Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Key pairs for elliptic curve cryptography are associated with a set of domain parameters \(D=(q,\mbox{FR},S,a,b,P,n,h)\) which consist of:

  1. 1.

    The order q of the underlying field .

  2. 2.

    An indication \(\mbox{FR}\) of the representation used for the elements of .

  3. 3.

    A seed S if the elliptic curve was generated verifiably at random using a method such as those described in FIPS 186-2 [1].

  4. 4.

    Two field elements a and b that define the equation of the elliptic curve: \(y^2=x^3+ax+b\) in the case that the characteristic of is not 2 or 3, and \(y^2+xy=x^3+ax^2+b\) if has characteristic 2.

  5. 5.

    A point of prime order.

  6. 6.

    The order n of P.

  7. 7.

    The cofactor .

Domain parameters may either be shared by a group of users, or they may be specific to each user.

Typically the cofactor h is small (e.g., h = 1, 2, 3 or 4). A suitable elliptic curve can be found by randomly selecting elliptic curves E over until is a prime or almost prime. The number of points can be determined using Schoof's algorithm [5]...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. FIPS 186-2 (2000). Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2. National Institute of Standards and Technology, Gaithersburg, MD.

    Google Scholar 

  2. FIPS 186-2 (2000). Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2. National Institute of Standards and Technology, Gaithersburg, MD.

    Google Scholar 

  3. Fouquet, M., P. Gaudry, and R. Harley (2000). “An extension of Satoh's algorithm and its implementation.” Journal of the Ramanujan Mathematical Society, 15, 281–318.

    MATH  MathSciNet  Google Scholar 

  4. Gaudry, P. (2002). “A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2.” Advances in Cryptography—ASIACRYPT 2002, Lecture Notes in Computer Science, vol. 2501, ed. Y. Zheng. Springer-Verlag, Berlin, 311–327.

    Google Scholar 

  5. Satoh, T. (2000). “The canonical lift of an ordinary elliptic curve over a prime field and its point counting.” Journal of the Ramanujan Mathematical Society, 15, 247–270.

    MATH  MathSciNet  Google Scholar 

  6. Schoof, R. (1985). “Elliptic curves over finite fields and the computation of square roots mod p.” Mathematics of Computation, 44, 483–494.

    MATH  MathSciNet  Google Scholar 

  7. Skjernaa, B. (2003). “Satoh's algorithm in characteristic 2.” Mathematics of Computation, 72, 477–487.

    MATH  MathSciNet  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 International Federation for Information Processing

About this entry

Cite this entry

Hankerson, D., Menezes, A. (2005). Elliptic Curve Keys. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_134

Download citation

Publish with us

Policies and ethics