Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2006-05-16
2006-05-16
Morse, Gregory (Department: 2134)
Cryptography
Particular algorithmic function encoding
Reexamination Certificate
active
07046801
ABSTRACT:
A cryptographic processing method in which dependence of cryptographic processing process and secret information on each other is cut off; and in which, when a scalar multiplied point is calculated from a scalar value and a point on an elliptic curve in an elliptic curve cryptosystem, a value of a bit of the scalar value is judged; and in which operations on the elliptic curve are executed a predetermined times and in a predetermined order without depending on the judged value of the bit.
REFERENCES:
patent: 5854759 (1998-12-01), Kaliski et al.
patent: 5987131 (1999-11-01), Clapp
patent: 0 981 115 (2000-02-01), None
patent: 0025204 (2000-05-01), None
J. Lopez, “Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation”, Cryptographic Hardware and Embedded Systems, 1stInternational Workshop, Ches '99, 1999 Proceedings, Lecture Notes in Computer Science, vol. 1717, Aug. 12, 1999, pp. 316-327.
Proceedings of CRYPTO '99, LNCS 1666, Springer-Verlag, (1999) pp. 388-397.
Proceedings of CHES '99, LNCS 1717, Springer-Verlag, (1999) pp. 292-302, 316-327.
Math. Comp. 48 (1987) pp. 243-264.
Hitachi , Ltd.
Lipman Jacob
Mattingly ,Stanger ,Malur & Brundidge, P.C.
Morse Gregory
LandOfFree
Method of calculating multiplication by scalars on an... 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 of calculating multiplication by scalars on an..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of calculating multiplication by scalars on an... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3599451