Algorithms and arithmetic operators for computing the ηT pairing in characteristic three

IEEE Transactions on Computers

Volumn 57, Issue 11, 2008, Pages 1454-1468

  Beuchat, Jean Luc ^a   Brisebarre, Nicolas ^b   Detrey, Jérémie ^c   Okamoto, Eiji ^a   Shirase, Masaaki ^d   Takagi, Tsuyoshi ^d  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b UNIVERSITÉ DE LYON   (France)

^c Rheinische Friedrich Wilhelms Universität   (Germany)

^d FUTURE UNIVERSITY HAKODATE   (Japan)

Author keywords

T pairing; Elliptic curve; Finite field arithmetic; FPGA; Hardware accelerator

Indexed keywords

DIGITAL ARITHMETIC; NETWORK PROTOCOLS;

CHARACTERISTIC THREES; COMPUTING; COPROCESSOR; CRYPTOGRAPHIC APPLICATIONS; CUBE ROOTS; ELLIPTIC CURVE; ELLIPTIC CURVES; FINITE FIELD ARITHMETIC; FPGA; HARDWARE ACCELERATOR; HARDWARE ACCELERATORS; HARDWARE ARCHITECTURES; RESEARCH AREAS; SOFTWARE IMPLEMENTATIONS;

CRYPTOGRAPHY;

EID: 54049118059     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2008.103     Document Type: Article

References (45)

1. D. Boneh, B. Lynn, and H. Shacham, "Short Signatures from the Weil Pairing," Advances in Cryptology - Proc. ASIACRYPT '01, C. Boyd, ed., pp. 514-532, 2001.
2. A. Menezes, T. Okamoto, and S.A. Vanstone, "Reducing Elliptic Curves Logarithms to Logarithms in a Finite Field," IEEE Trans. Information Theory, vol. 39, no. 5, pp. 1639-1646, Sept. 1993.
3. G. Frey and H.-G. Rück, "A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves," Math. Computation, vol. 62, no. 206, pp. 865-874, Apr. 1994.
4. S. Mitsunari, R. Sakai, and M. Kasahara, "A New Traitor Tracing," IEICE Trans. Fundamentals, vol. E85-A, no. 2, pp. 481-484, Feb. 2002.
5. R. Sakai, K. Ohgishi, and M. Kasahara, "Cryptosystems Based on Pairing," Proc. Symp. Cryptography and Information Security (SCIS '00), pp. 26-28, Jan. 2000.
6. A. Joux, "A One Round Protocol for Tripartite Diffie-Hellman," Proc. Algorithmic Number Theory - ANTS IV, W. Bosma, ed., pp. 385-394, 2000.
7. R. Dutta, R. Barua, and P. Sarkar, Pairing-Based Cryptographic Protocols: A Survey, cryptology ePrint Archive, Report 2004/64, 2004.
8. R. Granger, D. Page, and N.P. Smart, "High Security Pairing-Based Cryptography Revisited," Proc. Algorithmic Number Theory - ANTS VII F. Hess, S. Pauli, and M. Pohst, eds., pp. 480-494, 2006.
9. N. Koblitz and A. Menezes, "Pairing-Based Cryptography at High Security Levels," Cryptography and Coding, N.P. Smart, ed., pp. 13-36, Springer, 2005.
10. J.H. Silverman, The Arithmetic of Elliptic Curves. Springer-Verlag, 1986.
11. P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott, "Efficient Algorithms for Pairing-Based Cryptosystems," Advances in Cryptology - Proc. CRYPTO '02, M. Yung, ed., pp. 354-368, 2002.
12. E.R. Verheul, "Evidence that XTR Is More Secure than Super-singular Elliptic Curve Cryptosystems," J. Cryptology, vol. 17, no. 4, pp. 277-296, 2004.
13. V.S. Miller, Short Programs for Functions on Curves, http:// crypto.stanford.edu/miller, 1986.
14. V.S. Miller, "The Weil Pairing, and Its Efficient Calculation," J. Cryptology, vol. 17, no. 4, pp. 235-261, 2004.
15. S.D. Galbraith, K. Harrison, and D. Soldera, "Implementing the Tate Pairing," Algorithmic Number Theory - Proc. ANTS V, C. Fieker and D. Kohel, eds., pp. 324-337, 2002.
16. p - x + d," Advances in Cryptology - Proc. ASIACRYPT '03, C.S. Laih, ed., pp. 111-123, 2003.
17. S. Kwon, "Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields," Information Security and - Proc. ACISP '05, C. Boyd and J.M. González Nieto, eds., pp. 134-145, 2005.
18. P.S.L.M. Barreto, S.D. Galbraith, C. Ó hÉigeartaigh, and M. Scott, "Efficient Pairing Computation on Supersingular Abelian Varieties," Designs, Codes and Cryptography, vol. 42, no. 3, pp. 239-271, Mar. 2007
19. P. Grabher and D. Page, "Hardware Acceleration of the Tate Pairing in Characteristic Three," Cryptographic Hardware and Embedded Systems - Proc. CHES '05, J.R. Rao and B. Sunar, eds., pp. 398-411, 2005.
20. T. Kerins, W.P. Marnane, E.M. Popovici, and P. Barreto, "Efficient Hardware for the Tate Pairing Calculation in Characteristic Three," Cryptographic Hardware and Embedded - Proc. CHES '05, J.R. Rao and B. Sunar, eds., pp. 412-426, 2005.
21. G. Bertoni, L. Breveglieri, P. Fragneto, and G. Pelosi, "Parallel Hardware Architectures for the Cryptographic Tate Pairing," Proc. Third Int'l Conf. Information Technology: New Generations (ITNG), 2006.
22. C. Shu, S. Kwon, and K. Gaj, "FPGA Accelerated Tate Pairing Based Cryptosystem over Binary Fields," Proc. IEEE Int'l Conf. Field Programmable Technology (FPT '06), pp. 173-180, 2006.
23. R. Ronan, C. Murphy, T. Kerins, C. Ó hÉigeartaigh, and P.S.L.M. Barreto, "A Flexible Processor for the Characteristic 3 ηT Pairing," Int'l J. High Performance Systems Architecture, vol. 1, no. 2, pp. 79-88, 2007.
24. J. Jiang, "Bilinear Pairing (ηT Pairing) IP Core," technical report, Dept. of Computer Science, City Univ. of Hong Kong, May 2007.
25. J.-L. Beuchat, M. Shirase, T. Takagi, and E. Okamoto, "An Algorithm for the ηT Pairing Calculation in Characteristic Three and Its Hardware Implementation," Proc. 18th IEEE Symp. Computer Arithmetic (ARITH '07), P. Kornerup and J.-M. Muller, eds., pp. 97-104, 2007.
26. J.-L. Beuchat, N. Brisebarre, M. Shirase, T. Takagi, and E. Okamoto, "A Coprocessor for the Final Exponentiation of the ηT Pairing in Characteristic Three," Proc. First Int'l Workshop Arithmetic of Finite Fields (WAIFI '07), C. Carlet and B. Sunar, eds., pp. 25-39, 2007.
27. J.-L. Beuchat, N. Brisebarre, J. Detrey, and E. Okamoto, "Arithmetic Operators for Pairing-Based Cryptography," Cryptographic Hardware and Embedded Systems - Proc. CHES '07, P. Paillier and I. Verbauwhede, eds., pp. 239-255, 2007.
28. R. Granger, D. Page, and M. Stam, "On Small Characteristic Algebraic Tori in Pairing-Based Cryptography," LMS J. Computation and Math. vol. 9, pp. 64-85, Mar. 2006.
29. M. Shirase, T. Takagi, and E. Okamoto, "Some Efficient Algorithms for the Final Exponentiation of ηT Pairing," Proc. Third Int'l Information Security Practice and Experience Conf. (ISPEC '07), E. Dawson and D.S. Wong, eds., pp. 254-268, May 2007.
30. n : A Survey," Int'l J. Electronics, to appear.
31. m)," Acta Applicandae Math., vol. 93, nos. 1-3, pp. 33-55, Sept. 2006.
32. J. Guajardo, T. Güneysu, S. Kumar, C. Paar, and J. Pelzl, "Efficient Hardware Implementation of Finite Fields with Applications to Cryptography," Acta Applicandae Math., vol. 93, nos. 1-3, pp. 75-118, Sept. 2006.
33. L. Song and K.K. Parhi, "Low Energy Digit-Serial/Parallel Finite Field Multipliers," J. VLSI Signal Processing, vol. 19, no. 2, pp. 149-166, July, 1998.
34. R. Ronan, C. Ó hÉigeartaigh, C. Murphy, M. Scott, T. Kerins, and W. Marnane, "An Embedded Processor for a Pairing-Based Cryptosystem," Proc. Third Int'l Conf. Information Technology: New Generations (ITNG), 2006.
35. G. Meurice de Dormale, personal communication.
36. J.-C. Bajard, J. Duprat, S. Kla, and J.-M. Muller, "Some Operators for On-Line Radix-2 Computations," J. Parallel and Distributed Computing vol. 22, pp. 336-345, 1994.
37. m) Using Normal Bases," Information and Computation, vol. 78, pp. 171-177, 1988.
38. J. von zur Gathen and M. Nöcker, "Computing Special Powers in Finite Fields," Math. Computation, vol. 73, no. 247, pp. 1499-1523, 2003.
39. F. Rodríguez-Henríquez, G. Morales-Luna, N.A. Saqib, and N. Cruz-Cortés, "A Parallel Version of the Itoh-Tsujii Multiplicative Inversion Algorithm," Reconfigurable Computing: Architectures, Tools and Applications - Proc. ARC '07, P.C. Diniz, E. Marques, K. Bertels, M.M. Fernandes, and J.M.P. Cardoso, eds., pp. 226-237, 2007.
40. D.E. Knuth, The Art of Computer Programming, third ed. Addison-Wesley, 1998.
41. P.S.L.M. Barreto, A Note on Efficient Computation of Cube Roots in Characteristic 3, 2004 cryptology ePrint Archive, Report 2004/305.
42. A. Vithanage, personal communication.
43. T. Kerins, E. Popovici, and W. Marnane, "Algorithms and Architectures for Use in FPGA Implementations of Identity Based Encryption Schemes," Field-Programmable Logic and Applications, J. Becker, M. Platzner, and S. Vernalde, eds., pp. 74-83, Springer, 2004.
44. 6m," Selected Areas in Cryptography - Proc. SAC '07, C. Adams, A. Miri, and M. Wiener, eds., pp. 173-183, 2007.
45. F. Hess, N. Smart, and F. Vercauteren, "The Eta Pairing Revisited," IEEE Trans. Information Theory, vol. 52, no. 10, pp. 4595-4602, Oct. 2006.