Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
2011-07-26
2011-07-26
Orgad, Edan (Department: 2439)
Cryptography
Particular algorithmic function encoding
Public key
C380S028000, C380S046000, C708S490000, C708S491000, C708S492000, C708S518000, C708S523000, C708S525000
Reexamination Certificate
active
07986779
ABSTRACT:
Time to perform scalar point multiplication used for ECC is reduced by minimizing the number of shifting operations. These operations are minimized by applying modulus scaling by performing selective comparisons of points at intermediate computations based on primality of the order of an ECC group.
REFERENCES:
patent: 5521980 (1996-05-01), Brands
patent: 6876745 (2005-04-01), Kurumatani
patent: 7080109 (2006-07-01), Koc et al.
patent: 7590235 (2009-09-01), Hubert
patent: 7702105 (2010-04-01), Gura et al.
patent: 2003/0081771 (2003-05-01), Futa et al.
patent: 2007/0168411 (2007-07-01), Hubert
patent: 2009/0285386 (2009-11-01), Takashima
Ananyi, K.,‘Design of a Reconfigurable Processor for NIST Prime Field ECC’, 2006, Dept. of Electrical and Computer Engineering, Univ. of Victoria, entire document, http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.95.1321&rep=rep1&type=pdf.
Guajardo, J., et al, ‘Efficient Hardware Implementation of Finite Fields with Applications to Cryptography’, Sep. 26, 2006, © Springer Science, entire document, http://www.crypto.rub.de/imperia/md/content/texte/publications/journals/efficient—hard—finitef.pdf.
A. Menezes, “Efficient Implementation”, Handbook of Applied Cryptography, Chapter 14, 1997, pp. 591-634.
M. Brown et al., “Software Implementation of the NIST Elliptic Curves Over Prime Fields”, Lecture Notes In Computer Science; vol. 2020, Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA, Springer Verlang, 2001, pp. 205-265.
Certicom Corp., Standards for Efficient Cryptography, “SEC 1: Elliptic Curve Cryptography”, Version 1.0, Sep. 20, 2000, 96 pages.
Feghali Wajdi K.
Gopal Vinodh
Ozturk Erdinc
Wolrich Gilbert
Baum Ronald
Fleming Caroline M.
Intel Corporation
Orgad Edan
LandOfFree
Efficient elliptic-curve cryptography based on primality of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient elliptic-curve cryptography based on primality of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient elliptic-curve cryptography based on primality of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2663512