Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
2011-07-12
2011-07-12
LaForgia, Christian (Department: 2439)
Cryptography
Particular algorithmic function encoding
Public key
C380S028000, C380S046000, C708S490000, C708S491000, C708S492000, C708S518000, C708S523000, C708S525000
Reexamination Certificate
active
07978846
ABSTRACT:
The computation time to perform scalar point multiplication in an Elliptic Curve Group is reduced by modifying the Barrett Reduction technique. Computations are performed using an N-bit scaled modulus based a modulus m having k-bits to provide a scaled result, with N being greater than k. The N-bit scaled result is reduced to a k-bit result using a pre-computed N-bit scaled reduction parameter in an optimal manner avoiding shifting/aligning operations for any arbitrary values of k, N.
REFERENCES:
patent: 6141786 (2000-10-01), Cox et al.
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: 2005/0105723 (2005-05-01), Dupaquis et al.
patent: 2005/0267926 (2005-12-01), Al-Khoraidly et al.
patent: 2007/0116270 (2007-05-01), Fischer
patent: 2007/0168411 (2007-07-01), Hubert
patent: 2008/0025502 (2008-01-01), Kounavis et al.
patent: 2009/0285386 (2009-11-01), Takashima
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. 250-265.
Certicom Corp., Standards for Efficient Cryptography, “SEC 1: Elliptic Curve Cryptography”, Version 1.0, Sep. 20, 2000, 96 pages.
Hasenplough, W., et al., “Fast Modular Reduction”, 18th IEEE Symposium on Computer Arithmetic, 2007 (Arith '07), Jun. 25-27, 2007, pp. 225-229.
Office Action received for German Patent Application 102008030586.3, mailed on Nov. 2, 2009, 5 pages of German Office Action and 5 pages of English Translation.
Feghali Wajdi K.
Gopal Vinodh
Ozturk Erdinc
Wolrich Gilbert
Baum Ronald
Fleming Caroline M.
Intel Corporation
LaForgia Christian
LandOfFree
Scale-invariant barrett reduction for 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 Scale-invariant barrett reduction for elliptic-curve..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scale-invariant barrett reduction for elliptic-curve... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2714011