Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2005-04-05
2005-04-05
Caldwell, Andrew (Department: 2137)
Cryptography
Particular algorithmic function encoding
C380S030000, C708S250000, C708S400000, C708S442000
Reexamination Certificate
active
06876745
ABSTRACT:
A method and an apparatus capable of realizing at a high speed an elliptic curve cryptography in a finite field of characteristic 2, in which the elliptic curve is given by y2+xy=x3+ax2+b (b≠0) and an elliptic curve cryptography method which can protect private key information against leaking from deviation information of processing time to thereby defend a cipher text against a timing attack and a differential power analysis attack are provided. To this end, an arithmetic process for executing scalar multiplication arithmetic d(x, y) a constant number of times per bit of the private key d is adopted. Further, for the scalar multiplication d(x, y), a random number k is generated upon transformation of the affine coordinates (x, y) to the projective coordinates for thereby effectuating the transformation (x, y)→[kx, ky, k] or alternatively (x, y)→[k2x, k3y, k]. Thus, object for the arithmetic is varied by the random number (k).
REFERENCES:
patent: 5442707 (1995-08-01), Miyaji et al.
patent: 5497423 (1996-03-01), Miyaji
patent: 6307935 (2001-10-01), Crandall et al.
patent: 0874307 (1998-10-01), None
patent: 1166494 (2002-01-01), None
Cohen et al, Efficient Elliptic Curve Exponentiation using Mixed Coordinates Advances in Cryptology, Asaicrypt, 1998, pp. 51-65.
Agnew et al, An Implementation of Elliptic Curve Cryptosystems over F2155, IEEE Journal on Selected Areas in Communications, IEEE Inc., vol. 11, No. 5, Jun. 1, 1993, pp. 804-813.
D.V. Chudnovsky, G.V. Chudnovsky “Sequences of Numbers Generated by Addition in Formal Groups and New Primality and Factorization Tests”, Advances in Applied Mathematics, 7, 385-434, 1986.
P. Montgomery, “Speeding the Pollard and Elliptic Curve Methods of Factorization”, Mathematics of computation vol. 48, No. 177, pp. 243-264 (1987).
IEEE P1363/D2 Standard Specification for Public Key Cryptography (1998).
Henri Cohen, “A Course in Computational Algebraic Number Theory”, GTM138, Springer (1993) p. 464 Atkin's Test.
A. Menezes, P. Oorschot, S. Vanstone, “Handbook of Applied Cryptography”, CRC Press (1996) Section 4.5.3 Primitive polynomials.
Antonelli Terry Stout & Kraus LLP
Caldwell Andrew
Hitachi , Ltd.
Nguyen Minh Dieu
LandOfFree
Method and apparatus for elliptic curve cryptography and... 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 and apparatus for elliptic curve cryptography and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for elliptic curve cryptography and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3409410