Software implementation of tate pairing over GF(2m)

Proceedings -Design, Automation and Test in Europe, DATE

Volumn 2, Issue , 2006, Pages

  Bertoni, G ^a   Breveglieri, L ^b   Fragneto, P ^a   Pelosi, G ^b   Sportiello, L ^a  

^a STMICROELECTRONICS   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY FIELDS; COMPUTATION PERFORMANCE; DISCRETE LOGARITHM PROBLEMS; TATE PAIRING;

ADDERS; COMPUTATION THEORY; COMPUTER SIMULATION; PROBLEM SOLVING;

COMPUTER SOFTWARE;

EID: 34047149410     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2004.1269064     Document Type: Conference Paper

References (20)

1. IEEE Standard Specification for Public-Key Cryptography. Technical report, 2000.
2. P. Barreto, S. Galbraith, C. hEigeartaigh, and M. Scott. Efficient pairing computation on supersingular abelian varieties. Cryptology ePrint Archives, http://eprint.iacr.org, 2004.
3. P. Barreto, H. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. Advances in Cryptology - CRYPTO 2002, LNCS, 2442:354-368, 2002.
4. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. Advances in Cryptology - CRYPTO 2001, LNCS, 2139:213-229, 2001.
5. D. Boneh, B. Lynnn, and H. Shacham. Short signature from the Weil pairing. Proceedings of Asiacrypt 2001, LNCS, 2248:514-532, 2001.
6. n). Annual ACM Symposium on Theory of Computing '84, ACM Press, pages 201-207, 1984.
7. S. Galbraith, K. Harrison, and D.Soldera. Implementing the Tate pairing. Algorithm Number Theory Symposium - ANTS V, LNCS, 2369:324-337, 2002.
8. P. Gaudry, F. Hess, and N. Smart. Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology, 15:19-46, 2002.
9. D. Hankerson, J. Hernandez, and A. Menezes. Software implementation of elliptic curve cryptography over binary fields. Cryptographic Hardware and Embedded Systems -CHES, LNCS, 1965:1-24, 2000.
10. F. Hess. Exponent groups signature schemes and efficient identity based signature schemes based on pairings. Cryptology ePrint Archives http://eprint.iacr.org, 2002.
11. A. Joux. A one round protocol for tripartite diffie-hellman. Algorithm Number Theory Symposium - ANTS IV, LNCS, 1838:385-394, 2000.
12. A. K. Lenstra. Contributions Paper on Cryptographic Key Lengths to the Information Security Management Handbook. Harold F. Tipton, 2004.
13. N. McCullagh and P. Barreto. Efficient and for ward-secure identity-based signcryption. Cryptology ePrint Archives http://eprint.iacr.org, 2004.
14. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transaction on Information Theory, 39:1639-1646, 1993.
15. A. Odlyzko. Discrete logarithms in finite fields and their cryptographic significance. Advances in Cryptology - EUROCRYPT'84, LNCS, 209:224-314, 1985.
16. S. Pohlig and M. Hellman. An improved algorithm for computing logarithm over GF(p) and its cryptographic significance. IEEE Transaction on Information Theory, 24:106-110, 1978.
17. J. Pollard. Monte Carlo methods for index computation mod p. Mathematics of Computation, 32:918-924, 1978.
18. A. Shamir. Identity-based cryptosystems and signature schemes. Advances in Cryptology - CRYPTO '84, LNCS, 196:47-53, 1985.
19. N. Smart. An identity based authenticated key agreement protocol based on the Weil pairing. Cryptology ePrint Archives http://eprint.iacr.org, 2001.
20. E. Verheul. Evidence that xtr is more secure than supersingular elliptic curve cryptosystems. Advances in Cryptology - Eurocrypt 2001, LNCS, 2045:195-210, 2001.