An algorithm for the ηT pairing calculation in characteristic three and its hardware implementation

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2007, Pages 97-104

  Beuchat, Jean Luc ^a   Shirase, Masaaki ^b   Takagi, Tsuyoshi ^b   Okamoto, Eiji ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b FUTURE UNIVERSITY HAKODATE   (Japan)

Author keywords

T pairing; Characteristic three; Elliptic curve; FPGA; Hardware accelerator; Tate pairing

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; COST EFFECTIVENESS;

CUBE ROOT EXTRACTION; ELLIPTIC CURVE; HARDWARE ACCELERATOR; TATE PAIRING;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 36048945144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARITH.2007.10     Document Type: Conference Paper

References (25)

1. Altera. Cyclone II Device Handbook, 2006. Available from Altera's web site (http://altera.com).
2. Altera. DE2 Development and Education Board - User Manual, 2006. Available from Altera's web site (http://altera.com).
3. P. S. L. M. Barreto. A note on efficient computation of cube roots in characteristic 3. Cryptology ePrint Archive, Report 2004/305, 2004.
4. P. S. L. M. Barreto, S. Galbraith, C. ÓhÉigeartaigh, and M. Scott. Efficient pairing computation on supersingular Abelian varieties. Cryptology ePrint Archive, Report 2004/375, 2004.
5. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, number 2442 in Lecture Notes in Computer Science, pages 354-368. Springer, 2002.
6. G. Bertoni, L. Breveglieri, P. Fragneto, and G. Pelosi. Parallel hardware architectures for the cryptographic Tate pairing. In Proceedings of the Third International Conference on Information Technology: New Generations (ITNG'06). IEEE Computer Society, 2006.
7. T pairing calculation in characteristic three and its hardware implementation. Cryptology ePrint Archive, Report 2006/327, 2006.
8. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, number 2139 in Lecture Notes in Computer Science, pages 213-229. Springer, 2001.
9. D. Boneh, C. Gentry, and B. Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In V. Shoup, editor, Advances in Cryptology - CRYPTO 2005, number 3621 in Lecture Notes in Computer Science, pages 258-275. Springer, 2005.
10. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In C. Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, number 2248 in Lecture Notes in Computer Science, pages 514-532. Springer, 2001.
11. p - x + d. In C. S. Laih, editor, Advances in Cryptology - ASIACRYPT 2003, number 2894 in Lecture Notes in Computer Science, pages 111-123. Springer, 2003.
12. K. Fong, D. Hankerson, J. López, and A. Menezes. Field inversion and point halving revisited. IEEE Transactions on Computers, 53(8): 1047-1059, Aug. 2004.
13. S. D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In C. Fieker and D. Kohel, editors, Algorithmic Number Theory - ANTS V, number 2369 in Lecture Notes in Computer Science, pages 324-337. Springer, 2002.
14. P. Grabher and D. Page. Hardware acceleration of the Tate Pairing in characteristic three. In J. R. Rao and B. Sunar, editors, Cryptographic Hardware and Embedded Systems - CHES 2005, number 3659 in Lecture Notes in Computer Science, pages 398-411. Springer, 2005.
15. K. Harrison, D. Page, and N. P. Smart. Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. IMS Journal of Computation and Mathematics, 5:181-193, Nov. 2002.
16. Y. Kawahara, T. Takagi, and E. Okamoto. Efficient implementation of Tate pairing on a mobile phone using Java. Cryptology ePrint Archive, Report 2006/299, 2006.
17. T. Kerins, W. P. Marnane, E. M. Popovici, and P. Barreto. Efficient hardware for the Tate Pairing calculation in characteristic three. In J. R. Rao and B. Sunar, editors, Cryptographic Hardware and Embedded Systems - CHES 2005, number 3659 in Lecture Notes in Computer Science, pages 412-426. Springer, 2005.
18. S. Kwon. Efficient Tate pairing computation for supersingular elliptic curves over binary fields. Cryptology ePrint Archive, Report 2004/303, 2004.
19. V. S. Miller. Short programs for functions on curves. Unpublished manuscript available at http://crypto.Stanford.edu/miller/miller.pdf, 1986.
20. R. Ronan, C. Ó hÉigeartaigh, C. Murphy, M. Scott, T. Kerins, and W. Marnane. An embedded processor for a pairing-based cryptosystem. In Proceedings of the Third International Conference on Information Technology: New Generations (TTNG'06). IEEE Computer Society, 2006.
21. M. Scott, N. Costigan, and W. Abdulwahab. Implementing cryptographic pairings on smartcards. Cryptology ePrint Archive, Report 2006/144, 2006.
22. C. Shu, S. Kwon, and K. Gaj. FPGA accelerated Tate pairing based cryptosystem over binary fields. Cryptology ePrint Archive, Report 2006/179, 2006.
23. J.H.Silverman. The Arithmetic of Elliptic Curves. Number 106 in Graduate Texts in Mathematics. Springer-Verlag, 1986.
24. L. Song and K. K. Parhi. Low energy digit-serial/parallel finite field multipliers. Journal of VLSI Signal Processing, 19(2):149-166, July 1998.
25. D. Zuras. More on squaring and multiplying large integers. IEEE Transactions on Computers, 43(8):899-908, Aug. 1994.