Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2005-06-21
2010-06-22
Smithers, Matthew B (Department: 2437)
Cryptography
Particular algorithmic function encoding
Reexamination Certificate
active
07742596
ABSTRACT:
A method for reliable computation of point additions and point multiplications in an elliptic curve cryptography (ECC) system. Two asymmetric operations are performed: one of the operations is of slightly higher complexity than a conventional ECC operation, and the other operation is of much lower complexity than the first operation. The complexity of the second operation is a function of the desired degree of reliability, or the desired probability of failure detection. The method validates a computation involving one or more points on a specified elliptic curve by selecting a second elliptic curve, deriving a third elliptic curve from the specified and selected curves, projecting points onto the derived curve, performing a computation on the derived curve involving the projected points, validating the computation on the selected curve, extracting from the computation on the derived curve a predicted result of the computation on the selected curve, and comparing the predicted result to the computation on the selected curve. A predicted result of the computation to be validated may then be extracted from the computation on the derived curve. The predicted result is compared to an actual result of a computation on the selected curve, and if the results match, the predicted result of the computation performed on the selected curve is validated.
REFERENCES:
patent: 5854759 (1998-12-01), Kaliski et al.
patent: 6252959 (2001-06-01), Paar et al.
patent: 6430588 (2002-08-01), Kobayashi et al.
patent: 6618483 (2003-09-01), Vanstone et al.
patent: 6826586 (2004-11-01), Chang
patent: 7076061 (2006-07-01), Lenstra et al.
patent: 7177422 (2007-02-01), Akishita
patent: 2003/0081785 (2003-05-01), Boneh et al.
patent: 2003/0208518 (2003-11-01), Gura et al.
patent: 2004/0114760 (2004-06-01), Brown et al.
patent: 2004/0247115 (2004-12-01), Ono et al.
patent: 2006/0029221 (2006-02-01), Ibrahim
patent: 2006/0210068 (2006-09-01), Lauter et al.
patent: 2009/0113252 (2009-04-01), Lambert et al.
PCT International Search Report PCT/US05/30177, Sep. 29, 2006.
U.S. Dept. of Commerce/NIST, Federal Information Processing Standards Publication 186-2, “Digital Signature Standard,” Jan. 2000.
A.J. Menezes et al., “Handbook of Applied Cryptography,” CRC Press, Inc. 1997; Chapters 1, 10, and pp. 68, 612-613.
G. Orlando, “Efficient Elliptic Curve Processor Architectures for Field Programmable Logic,” Ph.D. dissertation, ECE Dept., Worcester Polytechnic Institute, Worcester, MA, Mar. 2002.
N. Demytko, “A New Elliptic Curve Based Analogue of RSA,” Advances in Cryptology—Eurocrypt '93 (LNCS 765), pp. 40-49, Springer-Verlag, 1994.
E. Brier et al., “Weierstrass Elliptic Curves and Side Channel Attacks,” Public Key Cryptography (LNCS 2274), pp. 335-345, Springer-Verlag, 2002.
N. Koblitz “Elliptic Curve Cryptosystems,” Mathematics of Computation, vol. 48, No. 177, Jan. 1987, pp. 203-209.
General Dynamics C4 Systems, Inc.
Ingrassia Fisher & Lorenz P.C.
Smithers Matthew B
Williams Jeffery
LandOfFree
Reliable elliptic curve cryptography computation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Reliable elliptic curve cryptography computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reliable elliptic curve cryptography computation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4195231