Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2007-11-19
2010-06-01
Kim, Jung (Department: 2432)
Cryptography
Particular algorithmic function encoding
C380S030000
Reexamination Certificate
active
07729494
ABSTRACT:
Methods and apparati are provided for use in determining “Squared Weil pairings” and/or “Squared Tate Pairing” based on an elliptic curve, for example, and which are then used to support cryptographic processing of selected information. Significant improvements are provided in computing efficiency over the conventional implementation of the Weil and Tate pairings. The resulting Squared Weil and/or Tate pairings can be substituted for conventional Weil or Tate pairings in a variety of applications.
REFERENCES:
patent: 5272755 (1993-12-01), Miyaji et al.
patent: 6446205 (2002-09-01), Lenstra
patent: 6968354 (2005-11-01), Kaminaga et al.
patent: 6986054 (2006-01-01), Kaminaga et al.
patent: 7079650 (2006-07-01), Knudsen
patent: 2003/0072443 (2003-04-01), Harley et al.
patent: 2003/0081785 (2003-05-01), Boneh et al.
patent: 2003/0182554 (2003-09-01), Gentry et al.
patent: 2004/0131191 (2004-07-01), Chen et al.
J. Manoharmayum, On the Modularity of Certain GL2 (F7) Galois Representations, Mathematical Reasearch Letters 8, 703-712 (2001) Received Jan. 23, 2001. and Revised version Received Aug. 29, 2001, Retrieved date Oct. 25, 2006.
Kristen Eisentager, Improved Weil and Tate Pairings for elliptic and hyperelliptic curves, Microsoft Research. 2004, Retrieved date Jan. 29, 2010.
Barreto, Paulo S.L.M., et al., “Efficient Algorithms for Pairing-Based Cryptosystems,” Universidade de Sao Paulo, Escola Politecnica, Sao Paulo (SP), Brazil & Computer Science Department, Stanford University, USA, pp. 1-16.
Boneh, et al., “Identity-Based Encryption from the Weil Pairing,” Siam J. Comput., vol. 32, No. 3, pp. 586-615, 2003 Society for Industrial and Applied Mathematics.
Boneh et al., “Short signatures from the Weil pairing,” pp. 1-17.
Cantor, “Computing in the Jacobian of a Hyperelliptic Curve,” Mathematics of Computation, vol. 48, No. 177, Jan. 1987, pp. 95-101.
Chen, et al., “Identity Based Authenticated Key Agreement Protocols from Pairings”, IEEE, 2003, pp. 15.
Eisentrager, et al., “Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation,” Topics in Cryptology, CT-RSA 2003, Marc Joye (Ed), pp. 343-354, LNCS 2612, Springer-Verlag, 2003.
Frey, Gerhard et al., “A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves,” Mathematics of Computation, vol. 62, No. 206, Apr. 1994, pp. 865-874.
Frey, et al., “The Tate Pairing and the Discrete Logarithm Applied to Elliptic Curve Cryptosystems”, IEEE Transactions on Information Theory, vol. 45, No. 5, Jul. 1999, pp. 1717-1719.
Galbraith, et al., “Implementing the Tate Pairing,” Mathematics Dept., Royal Holloway, University of London, Egham, Surrey, UK & Hewlett-Packard Laboratories, Bristol, Filton Road, Stoke Gifford, Bristol, UK, pp. 1-14.
Hess, Florian et al., “Two Topics in Hyperelliptic Cryptography,” S. Vaudenay & A. Youssef (Eds.): SAC 2001, LNCS 2259, 2001, pp. 181-189.
IEEE Transactions on information theory, V 45, No. 5, Jul. 1999, 1717-1719, Retrieved date Oct. 25, 2006.
Joux, “The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems (Survey),”C. Fieker and D.R. Kohel (eds.): ANTS 2002, LNCS 2369, pp. 20-32, 2002 (Springer-Verlag Berlin Heidelberg 2002).
Koblitz, “Elliptic Curve Cryptography”, Jan. 5, 2007, at <<http://www.msri.org/publications/In/msri/1998/crypt/koblitz/1/banner/01.html>>, MSRI, Jan. 11, 1998, pp. 1-34.
Li, et al., “Performance of Finite Field Arithmetic in an Elliptic Curve Crytosystem”, IEEE, 2001, pp. 249-256.
Manoharmayum, “On the Modularity of Certain GL2 (F7) Galois Representations”, Mathematical Research Letters 8, 703-712 (2001). Revised version received Aug. 29, 2001. Retrieved date Oct. 25, 2006.
Menezes, Alfred J., et al., “Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field,” (0018-9448/93 1993 IEEE, IEEE Transactions on Information . . . ), 8 pages.
“Public-Key Cryptography”, IEEE, 2000, pp. 117-131.
Eisentraeger Anne Kirsten
Lauter Kristin E.
Montgomery Peter L.
Kim Jung
Lee & Hayes PLLC
Lemma Samson B
Microsoft Corporation
LandOfFree
Squared Weil and Tate pairing techniques for use with... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Squared Weil and Tate pairing techniques for use with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Squared Weil and Tate pairing techniques for use with... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4200373