Faster implementation of ηt pairing over GF(3m) using minimum number of logical instructions for GF(3)-addition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5209 LNCS, Issue , 2008, Pages 282-296

  Kawahara, Yuto ^a   Aoki, Kazumaro ^b   Takagi, Tsuyoshi ^a  

^a FUTURE UNIVERSITY HAKODATE   (Japan)

^b NTT CORPORATION   (Japan)

Author keywords

T pairing; GF(3) addition; Logical instruction

Indexed keywords

FASTER IMPLEMENTATION; GF(3)-ADDITION; INTERNATIONAL CONFERENCES; LOGICAL INSTRUCTION; PAIRING-BASED CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 52149105427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85538-5_19     Document Type: Conference Paper

References (30)

1. 3m. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 85-102. Springer, Heidelberg (2007)
2. Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for Key Management - Part 1: General (Revised). NIST Special Publication 800-57 (2007)
3. Barreto, P.S.L.M., Galbraith, S., Ó'hÉigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42(3), 239-271 (2007)
4. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354-368. Springer, Heidelberg (2002)
5. m) arithmetic architectures for cryptographic applications. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 158-175. Springer, Heidelberg (2003)
6. Beuchat, J., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the η. pairing in characteristic three. Cryptology ePrint Archive, Report 2007/417 (2007)
7. Beuchat, J., Shirase, M., Takagi, T., Okamoto, E.: An algorithm for the ηT pairing calculation in characteristic three and its hardware implementation. In: 18th IEEE International Symposium on Computer Arithmetic ARITH-18, pp. 97-104 (2007)
8. Boneh, D., Crescenzo, D., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004)
9. Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM Journal on Computing 32(3), 586-615 (2003)
10. Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258-275. Springer, Heidelberg (2005)
11. Compaq Computer Corporation: Alpha Architecture Handbook (Version 4) (1998)
12. p - x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
13. Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324-337. Springer, Heidelberg (2002)
14. 36m. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 173-183. Springer, Heidelberg (2007)
15. Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 480-494. Springer, Heidelberg (2006)
16. Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing-based cryptography in characteristic three. IEEE Transactions on Computers 54(7), 852-860 (2005)
17. Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. Centre for Applied Cryptographic Research (CACR) Technical Reports, CACR 2008-08 (2008), ttp://www.cacr.math.uwaterloo.ca/techreports/2008/cacr2008- 08.pdf
18. Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
19. Harrison, K., Page, D., Smart, N.P.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS Journal of Computation and Mathematics 5, 181-193 (2002)
20. Intel Corporation: Intel Architecture Software Developer's Manual, vol. 2, Instruction Set Reference (1999)
21. SPARC International, Inc.: The SPARC Architecture Manual, Version 9 (2000)
22. Kerins, T., Marnane, W., Popovici, E., Barreto, P.S.L.M.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 412-426. Springer, Heidelberg (2005)
23. Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13-36. Springer, Heidelberg (2005)
24. Miller, V.S.: Short program for functions on curves (unpublished manuscript, 1986)
25. Page, D., Smart, N.P.: Hardware implementation of finite fields of characteristic three. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 529-539. Springer, Heidelberg (2003)
26. Page, D., Smart, N., Vercauteren, F.: A comparison of MNT curves and super-singular curves. Applicable Algebra in Engineering. Communication and Computing 17(5), 379-392 (2006)
27. Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve. Cryptology ePrint Archive, Report 2003/054 (2003)
28. T pairing algorithm over arbitrary extension degree. In: Kim, S., Yung, M., Lee, H.-W. (eds.) WISA 2007. LNCS, vol. 4867, pp. 1-15. Springer, Heidelberg (2008)
29. T pairing. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol. 4464, pp. 254-268. Springer, Heidelberg (2007)
30. m) multiplication algorithm for ηT pairing. Cryptology ePrint Archive, Report 2007/463 (2007)