Cryptography – Key management – Having particular key generator
Reexamination Certificate
2011-08-09
2011-08-09
Lanier, Benjamin E (Department: 2432)
Cryptography
Key management
Having particular key generator
C380S028000, C380S030000
Reexamination Certificate
active
07995752
ABSTRACT:
This invention provides a method for accelerating multiplication of an elliptic curve point Q(x,y) by a scalar k, the method comprising the steps of selecting an elliptic curve over a finite field Fq where q is a prime power such that there exists an endomorphism ψ, where ψ(Q)=λ·Q for all points Q(x,y) on the elliptic curve; and using smaller representations kiof the scalar k in combination with the mapping y to compute the scalar multiple of the elliptic curve point Q.
REFERENCES:
patent: 5999626 (1999-12-01), Mullin et al.
patent: 6212277 (2001-04-01), Miyaji
patent: 6212279 (2001-04-01), Reiter et al.
patent: 6263081 (2001-07-01), Miyaji et al.
patent: 6430588 (2002-08-01), Kobayashi et al.
patent: 6567832 (2003-05-01), Ono et al.
patent: 2000-276046 (2000-10-01), None
patent: WO 00/39668 (2000-06-01), None
Cheon, J.H. et al., Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map, Public Key Cryptography, First International Workshop on Practice and Theory in Public Key Cryptography, PKC '98 Proceedings, 1998, pp. 195-202, Springer-Verlag, Berlin, Germany.
Gordon, D., A Survey of Fast Exponentiation Methods, Dec. 30, 1997, pp. 1-22, Center for Communications Research, San Diego, California.
Koblitz, N., CM-Curves with Good Cryptographic Properties, Advances in Cryptography Crypto '91, 1991, pp. 279-287, Springer-Verlag, Berlin, Germany.
Koyama, K. et al., Speeding Up Elliptic Cryptosystems by Using a Signed Binary Window Method, Advances in Cryptology—Crypto '92, 1992, pp. 345-357, vol. 740, Springer-Verlag, London, UK.
Lercier, R., Finding Good Random Elliptic Curves for Cryptosystems Defined over Finite Fields, , Advances in Cryptography—Eurocrypt '97, 1997, pp. 379-392, Springer-Verlag, Berlin, Germany.
Menezes, A. et al., Handbook of Applied Cryptography, 1997, pp. 613-628, CRC Press.
Moeller, B., Algorithms for multi-exponentiation, Technical Report T1-8101, Apr. 27, 2001, pp. 1-15, TU Darmstadt, Germany.
Mueller, V., Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two, URL:ftp://informatik.tu-darmstadt. de/pub/TI/reports/vmueller.jc.ps.gz, Jun. 1997, pp. 1-18, Darmstadt, Germany.
Solinas, J., An Improved Algorithm for Arithmetic on a Family of Elliptic Curves, Advances in Cryptology—Crypto-'97, Santa Barbara, California, Aug. 1997, pp. 357-371, Springer-Verlag, Berlin, Germany.
Solinas, J., Low-weight Binary Representations for Pairs of Integers, Technical Report 2001, CORR 2001-41, Centre for Applied Cryptographic Research, Waterloo, Ontario, Canada.
Lambert Robert J.
Vadekar Ashok
Blake Cassels & Graydon LLP
Certicom Corp.
Lanier Benjamin E
Orange John R.S.
Slaney Brett J.
LandOfFree
Method for accelerating cryptographic operations on elliptic... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for accelerating cryptographic operations on elliptic..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for accelerating cryptographic operations on elliptic... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2651503