Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2007-02-13
2007-02-13
Moazzami, Nasser (Department: 2136)
Cryptography
Particular algorithmic function encoding
C380S030000, C708S492000
Reexamination Certificate
active
10128805
ABSTRACT:
An elliptic curve encryption processing method and an elliptic curve encryption processing apparatus enable high-speed elliptic curve encryption processing computations to be realized. In elliptic curve encryption processing computations, two scalar multiplications, kP and lQ, are not performed separately, but the computation process of kP+lQ is performed simultaneously. In the computation of scalar multiplications, kP and lQ are set on a Montgomery elliptic curve By2=x3+Ax2+x. On the basis of a combination of each bit value of k and l from the high-order bits of the binary representation data of the scalar quantities k and l, a computation relation of the next four points based on the computed four points is selected, and based on the selected relation, a process of computing the next four points is repeatedly performed to eventually compute kP+lQ.
REFERENCES:
patent: 6185596 (2001-02-01), Hadad et al.
patent: 6240436 (2001-05-01), McGregor
patent: 6416594 (2002-07-01), Yamagami et al.
patent: 6430588 (2002-08-01), Kobayashi et al.
patent: 6480606 (2002-11-01), Kurumatani
patent: 6546104 (2003-04-01), Shimbo et al.
patent: 6748410 (2004-06-01), Gressel et al.
patent: 6782100 (2004-08-01), Vanstone et al.
patent: 2001/0048741 (2001-12-01), Okeya
Okeya, Katsuyuki et al, Elliptic Curves with the Montgomery—Form and their Cryptographic Applications, Springer—Verlag, 2000.
Hankerson, Darrel et al, Software Implementation of Elliptic Curve Cryptography over Binary Fields, Springer—Verlag, 2000.
X9.62-1998 Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), pp. 71-86, 1998 American Bankers Association.
Okeya, Katsuyuki et al, Power Analysis Breaks Elliptic Curve Cryptosystems Even Secure Against The Timing Attack, Springer—Verlag, 2000.
Julio Lopez et al, Fast multiplication on elliptic curves over GF(2{circumflex over ())}{circumflex over (})}m) without precomputation, 1999.
Chae Hoon et al, Speeding up elliptic Scalar Multiplication with Precomputation, Lecture Notes in CS, 2000.
Katsuyuki Okeya et al, Power Analysis Breaks Elliptic Curve Cryptosystems Even Secure Against The Timing Attack, Springer Verlag, 2000.
“Standard Specifications for Public Key Cryptography”, IEEE P1363/D13 (Draft Version 13), pp. 1-73, (1999).
Peter L. Montgomery, “Speeding the Pollard and Elliptic Curve Methods of Factorization”, Mathematics of Computation, vol. 48, No. 177, Jan. 1987, pp. 243-264.
J. Lopez et al., “Fast Multiplication on Elliptic Curves over GF (2m) without Precomputation”, Cryptographic Hardware and Embedded Systems, LNCS, pp. 316-327 (1999).
Abedin Shanto M Z
Lerner David Littenberg Krumholz & Mentlik LLP
Moazzami Nasser
Sony Corporation
LandOfFree
Elliptic curve encryption processing method, elliptic curve... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Elliptic curve encryption processing method, elliptic curve..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elliptic curve encryption processing method, elliptic curve... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3854883