Compact hardware for computing the tate pairing over 128-bit-security supersingular curves

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

Volumn 6487 LNCS, Issue , 2010, Pages 397-416

  Estibals, Nicolas ^a  

^a LORIA   (France)

Author keywords

FPGA implementation; supersingular elliptic curves; Tate pairing

Indexed keywords

FINITE FIELDS; FPGA IMPLEMENTATIONS; HARDWARE IMPLEMENTATIONS; NOVEL METHODS; PROOF OF CONCEPT; SECURITY TARGET; SUPERSINGULAR CURVES; SUPERSINGULAR ELLIPTIC CURVE; TATE PAIRING; TOWER FIELDS;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA); HARDWARE;

CRYPTOGRAPHY;

EID: 78650280305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17455-1_25     Document Type: Conference Paper

References (49)

1. Adleman, L.M.: The function field sieve. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 108-121. Springer, Heidelberg (1994)
2. Barenghi, A., Bertoni, G., Breveglieri, L., Pelosi, G.: A FPGA coprocessor for the cryptographic Tate pairing over Fp. In: Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2008). IEEE Computer Society, Los Alamitos (2008)
3. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairingbased cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354-369. Springer, Heidelberg (2002)
4. Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer, Heidelberg (2005)
5. Barreto, P., Galbraith, S., héigeartaigh, C.ó., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42(3), 239-271 (2007)
6. Beuchat, J.L., Brisebarre, N., Detrey, J., Okamoto, E., Rodríguez-Henríquez, F.: A comparison between hardware accelerators for the modified Tate pairing over F2m and F3m. In: Galbraith, S., Paterson, K. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 297-315. Springer, Heidelberg (2008)
7. Beuchat, J.L., Doi, H., Fujita, K., Inomata, A., Ith, P., Kanaoka, A., Katouno, M., Mambo, M., Okamoto, E., Okamoto, T., Shiga, T., Shirase, M., Soga, R., Takagi, T., Vithanage, A., Yamamoto, H.: FPGA and ASIC implementations of the ?T pairing in characteristic three. Computers and Electrical Engineering 36(1), 73-87 (2010)
8. Beuchat, J.L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the ?t pairing in characteristic three. IEEE Transactions on Computers - Special Section on Special-Purpose Hardware for Cryptography and Cryptanalysis 57(11), 1454-1468 (2008)
9. Beuchat, J.L., Detrey, J., Estibals, N., Okamoto, E., Rodr?iguez-Henríquez, F.: Fast architectures for the ?T pairing over small-characteristic supersingular elliptic curves (2009), cryptology ePrint Archive, Report 2009/398
10. Beuchat, J.L., Detrey, J., Estibals, N., Okamoto, E., Rodríguez-Henríquez, F.: Hardware accelerator for the Tate pairing in characteristic three based on Karatsuba-Ofman multipliers. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 225-239. Springer, Heidelberg (2009)
11. Beuchat, J.L., López-Trejo, E., Martínez-Ramos, L., Mitsunari, S., Rodríguez- Henríquez, F.: Multi-core implementation of the Tate pairing over supersingular elliptic curves. In: Garay, J., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 413-432. Springer, Heidelberg (2009)
12. Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
13. Boneh, D., Lynn, B., Shacham, H.: Short Signatures from theWeil Pairing. Journal of Cryptology 17(4), 297-319 (2004)
14. 3ℓmm ≥ 1 and 5≤ℓ≤18 In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 406-414. Springer, Heidelberg (2008)
15. Cenk, M.,Özbudak, F.: On multiplication in finite fields. Journal of Complexity 26(2), 172-186 (2010)
16. Cesena, E.: Pairing with supersingular Trace Zero Varieties revisited (2008), cryptology ePrint Archive, Report 2008/404
17. Diem, C.: On the discrete logarithm problem in class groups of curves. Mathemathics of Computation (to appear)
18. 2 =xp - x + d. In: Laih, C. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
19. Duursma, I.M., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms. In: Lam, K.Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 103-121. Springer, Heidelberg (1999)
20. El-Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1985. LNCS, vol. 196, pp. 10-18. Springer, Heidelberg (1984)
21. Fan, H., Hasan, M.A.: Comments on Montgomerys Five, Six, and Seven-Term Karatsuba-Like Formulae. IEEE Transactions on Computers 56(5), 716-717 (2007)
22. Fan, J., Vercauteren, F., Verbauwhede, I.: Faster Fp-arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 240-253. Springer, Heidelberg (2009)
23. Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Proceedings of the Fifth International Conference on Finite Fields and Applications (Augsburg, 1999), pp. 128-161. Springer, Heidelberg (2001)
24. Frey, G., Rück, H.G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation 62(206), 865-874 (1994)
25. Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Improving the parallelized Pollard lambda search on anomalous binary curves. Math. Comput. 69(232), 1699-1705 (2000)
26. Gaudry, P.: Index calculus for abelian varieties and the elliptic curve discrete logarithm problem. Journal of Symbolic Compution 44(12), 1690-1702 (2009)
27. Gaudry, P., Hess, F., Smart, N.: Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology 15(1), 19-46 (2002)
28. Granger, R.: On the static Diffie-Hellman problem on elliptic curves over extension fields. In: ASIACRYPT. LNCS, Springer, Heidelberg (2010) (to appear)
29. Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Information and Computation 78(3), 171-177 (1988)
30. Jiang, J.: Bilinear pairing (Eta T Pairing) IP core. Tech. rep., City University of Hong Kong - Department of Computer Science (May 2007)
31. Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385-394. Springer, Heidelberg (2000)
32. 5 ) (2010), cryptology ePrint Archive, Report 2010/157
33. Kammler, D., Zhang, D., Schwabe, P., Scharwaechter, H., Langenberg, M., Auras, D., Ascheid, G., Mathar, R.: Designing an ASIP for cryptographic pairings over Barreto-Naehrig curves. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 254-271. Springer, Heidelberg (2009)
34. Kerins, T., Marnane, W., Popovici, E., Barreto, P.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 412-426. Springer, Heidelberg (2005)
35. Leyland, P.: Cunningham numbers,
36. Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory 39(5), 1639-1646 (1993)
37. Miller, V.S.: Short programs for functions on curves. IBM, Thomas J. Watson Research Center (1986)
38. Miller, V.S.: The Weil pairing, and its efficient calculation. J. Cryptology 17(4), 235-261 (2004)
39. Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. Fundamentals E85-A(2), 481-484 (2002)
40. Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers 54(3), 362-369 (2005)
41. Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings (2010), cryptology ePrint Archive, Report 2010/186
42. Pollard, J.: Monte Carlo methods for index computation (mod p). Mathematics of Computation, 918-924 (1978)
43. Ronan, R., héigeartaigh, C.ó., Murphy, C., Scott, M., Kerins, T.: Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve. Journal of Systems Architecture 53, 85-98 (2007)
44. Rubin, K., Silverberg, A.: Supersingular abelian varieties in cryptology. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 336-353. Springer, Heidelberg (2002)
45. Rubin, K., Silverberg, A.: Using abelian varieties to improve pairing-based cryptography. Journal of Cryptology 22(3), 330-364 (2009)
46. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security (SCIS 2000), Okinawa, Japan, pp. 26-28 (January 2000)
47. Shu, C., Kwon, S., Gaj, K.: Reconfigurable computing approach for Tate pairing cryptosystems over binary fields. IEEE Transactions on Computers 58(9), 1221-1237 (2009)
48. Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol. 106. Springer, Heidelberg (1986)
49. Wagstaff, S.: The Cunningham Project,