Use of bilinear mappings in cryptographic applications

Details Use of bilinear mappings in cryptographic applications Use of bilinear mappings in cryptographic applications

2011-04-19

2011-04-19

Smithers, Matthew B (Department: 2437)

Cryptography

Particular algorithmic function encoding

Public key

C713S150000

Reexamination Certificate

active

07929691

ABSTRACT:
Cryptographic methods are known that involve the computation of a non-degenerate bilinear mapping of first and second elements one of which comprises a secret of a first entity. For a mapping implemented as, for example, a Tate pairing, the mapping is computable by applying a predetermined function to the first and second elements and then exponentiating the result with a known exponent. Improvements in respect of computational loading, size of output, and security are enabled for the first party by arranging for the first entity to carry out only part of the mapping, a second entity being used to complete computation of the mapping. Cryptographic applications using these improvements are also disclosed.

REFERENCES:
patent: 7113594 (2006-09-01), Boneh et al.
patent: 7120311 (2006-10-01), Snyder
patent: 7239701 (2007-07-01), Ogishi et al.
patent: 7481363 (2009-01-01), Zuili
patent: 7587605 (2009-09-01), Venkatesan et al.
patent: 7590236 (2009-09-01), Boneh et al.
patent: 7594261 (2009-09-01), Lauter et al.
patent: 7634087 (2009-12-01), Boneh et al.
patent: 7639799 (2009-12-01), Lauter et al.
patent: 7769167 (2010-08-01), Eisentraeger et al.
patent: 2002/0021803 (2002-02-01), Solinas
patent: 2002/0073316 (2002-06-01), Collins et al.
patent: 2003/0081785 (2003-05-01), Boneh et al.
patent: 2003/0179950 (2003-09-01), Komura et al.
patent: 2004/0064700 (2004-04-01), Kim et al.
patent: 2004/0123098 (2004-06-01), Chen et al.
patent: 2004/0131191 (2004-07-01), Chen et al.
patent: 2004/0139029 (2004-07-01), Zhang et al.
patent: 2005/0036609 (2005-02-01), Eisentraeger et al.
patent: 2005/0038755 (2005-02-01), Silverbook et al.
patent: 2005/0262354 (2005-11-01), Komano
patent: 1 379 024 (2004-01-01), None
patent: WO03/017559 (2003-02-01), None
Steven D. Galbraith, Keith Harrison, David Soldera, Implementing the Tate pairing, Mar. 8, 2002.
Menezes, Applied cryptography, 1197,CRC press LLC, p. 516.
Galbraith et al , Implementing the Tate paring, Mar. 8, 2002, Trusted E-services Laboratory, HP laboratoris Bristol, p. 1-15.
Granger et al , On Small characteristic algebraic tori in pairing-based crytography, Jun. 2004, London Mathematical society, 2000 mathematics subject classification 94A60,20G40,11T99, p. 64-85.
Barreto, P. et al., “Efficient Algorithms for Pairing-Based Cryptosystems” Cryptology Eprint Archive: Report 2002/008, pp. 1-16, XP002355407 (2002).
Boneh, D. et al., “Identity-Based Encryption from the Weil Pairing,” Computer Science, vol. 2139, pp. 213-229 (2001).
Boneh, D. et al., “Identity-Based Encryption from the Weil Pairing,” SIAM J. of Computing, vol. 32, No. 3, pp. 586-615 (2003).
Granger, R. et al., “Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three,” Cryptology Eprint Archive: Report 2004/157 pp. 1-22, XP002355408 (2004).
McCullagh, N. et al., “Efficient and Forward-Secure Identity-Based Signcryption” (May 2004).
Shim, K., “Efficient ID-based authenticated key agreement protocol based on Weil-pairing” Electronics Letters, vol. 39, No. 8, pp. 653-654 (2003).

Affiliated with

Also associated with

Rating

Use of bilinear mappings in cryptographic applications does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Use of bilinear mappings in cryptographic applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Use of bilinear mappings in cryptographic applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2652784