Hardware accelerator for the tate pairing in characteristic three based on Karatsuba-Ofman multipliers

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

Volumn 5747 LNCS, Issue , 2009, Pages 225-239

  Beuchat, Jean Luc ^a   Detrey, Jérémie ^b   Estibals, Nicolas ^b   Okamoto, Eiji ^a   Rodríguez Henríquez, Francisco ^c  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b INRIA   (France)

^c DEPARTAMENTO DE FÍSICA   (Mexico)

Author keywords

T pairing; Elliptic curve; Finite field arithmetic; FPGA; Hardware accelerator; Karatsuba Ofman multiplier; Tate pairing

Indexed keywords

ELLIPTIC CURVE; FINITE FIELD ARITHMETIC; FPGA; HARDWARE ACCELERATOR; KARATSUBA-OFMAN MULTIPLIER; TATE PAIRING;

ACCELERATION; COMPUTATION THEORY; CRYPTOGRAPHY; EMBEDDED SYSTEMS; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); FREQUENCY MULTIPLYING CIRCUITS; GEOMETRY; MATHEMATICAL OPERATORS;

HARDWARE;

EID: 70350614536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04138-9_17     Document Type: Conference Paper

References (46)

1. p. In: Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2008). IEEE Computer Society Press, Los Alamitos (2008)
2. Barreto, P.S.L.M.: A note on efficient computation of cube roots in characteristic 3. Cryptology ePrint Archive, Report 2004/305 (2004)
3. Barreto, P.S.L.M., Galbraith, S.D., ÓhÉigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Designs, Codes and Cryptography 42, 239-271 (2007)
4. 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-368. Springer, Heidelberg (2002)
5. 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 (2006)
6. Bertoni, G., Breveglieri, L., Fragneto, P., Pelosi, G.: Parallel hardware architectures for the cryptographic Tate pairing. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006). IEEE Computer Society Press, Los Alamitos (2006)
7. 3m. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 297-315. Springer, Heidelberg (2008)
8. T pairing in characteristic three. IEEE Transactions on Computers 57(11), 1454-1468 (2008)
9. T pairing in characteristic three. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 25-39. Springer, Heidelberg (2007)
10. T pairing in characteristic three. In: Computers and Electrical Engineering (to appear)
11. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
12. 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)
13. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514-532. Springer, Heidelberg (2001)
14. p - x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
15. Fan, H., Sun, J., Gu, M., Lam, K.-Y.: Overlap-free Karatsuba-Ofman polynomial multiplication algorithm. Cryptology ePrint Archive, Report 2007/393 (2007)
16. 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)
17. Galbraith, S.D., 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)
18. 36m. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 173-183. Springer, Heidelberg (2007)
19. Grabher, P., Page, D.: Hardware acceleration of the Tate pairing in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 398-411. Springer, Heidelberg (2005)
20. 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)
21. Hankerson, D., Menezes, A., Scott, M.: Identity-Based Cryptography. In: Software Implementation of Pairings, ch. 12. Cryptology and Information Security Series, pp. 188-206. IOS Press, Amsterdam (2009)
22. Hanrot, G., Zimmermann, P.: A long note on Mulders' short product. Journal of Symbolic Computation 37(3), 391-401 (2004)
23. Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 18-38. Springer, Heidelberg (2008)
24. Hess, F., Smart, N., Vercauteren, F.: The Eta pairing revisited. IEEE Transactions on Information Theory 52(10), 4595-4602 (2006)
25. Jiang, J.: Bilinear pairing (Eta T Pairing) IP core. Technical report, City University of Hong Kong - Department of Computer Science (May 2007)
26. 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)
27. Kammler, D., Zhang, D., Schwabe, P., Scharwaechter, H., Langenberg, M., Auras, D., Ascheid, G., Leupers, R., Mathar, R., Meyr, H.: Designing an ASIP for cryptographic pairings over Barreto-Naehrig curves. Cryptology ePrint Archive, Report 2009/056 (2009)
28. m) Tate pairing architecture. In: Bertels, K., Cardoso, J.M.P., Vassiliadis, S. (eds.) ARC 2006. LNCS, vol. 3985, pp. 358-369. Springer, Heidelberg (2006)
29. m). Computers and Electrical Engineering 33(5-6), 392-406 (2007)
30. Kerins, T., Marnane, W.P., Popovici, E.M., 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)
31. Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13-36. Springer, Heidelberg (2005)
32. Kömürcü, G., Savaş, E.: An efficient hardware implementation of the Tate pairing in characteristic three. In: Prasolova-Førland, E., Popescu, M. (eds.) Proceedings of the Third International Conference on Systems - ICONS 2008, pp. 23-28. IEEE Computer Society Press, Los Alamitos (2008)
33. Li, H., Huang, J., Sweany, P., Huang, D.: FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field. Journal of Systems Architecture 54, 1077-1088 (2008)
34. Menezes, A., Okamoto, T., Vanstone, S.A.: Reducing elliptic curves logarithms to logarithms in a finite field. IEEE Transactions on Information Theory 39(5), 1639-1646 (1993)
35. Miller, V.S.: Short programs for functions on curves (1986), http://crypto.stanford.edu/miller
36. Miller, V.S.: The Weil pairing, and its efficient calculation. Journal of Cryptology 17(4), 235-261 (2004)
37. T pairing in characteristic three on Intel Core 2 Duo processor. Cryptology ePrint Archive, Report 2009/032 (2009)
38. Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. Fundamentals E85-A(2), 481-484 (2002)
39. T pairing. Int. J. High Performance Systems Architecture 1(2), 79-88 (2007)
40. Ronan, R., ÓhÉigeartaigh, C., Murphy, C., Scott, M., Kerins, T.: FPGA acceleration of the Tate pairing in characteristic 2. In: Proceedings of the IEEE International Conference on Field Programmable Technology - FPT 2006, pp. 213-220. IEEE, Los Alamitos (2006)
41. 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)
42. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security (SCIS 2000), Okinawa, Japan, January 2000, pp. 26-28 (2000)
43. Shu, C., Kwon, S., Gaj, K.: FPGA accelerated Tate pairing based cryptosystem over binary fields. In: Proceedings of the IEEE International Conference on Field Programmable Technology - FPT 2006, pp. 173-180. IEEE, Los Alamitos (2006)
44. Song, L., Parhi, K.K.: Low energy digit-serial/parallel finite field multipliers. Journal of VLSI Signal Processing 19(2), 149-166 (1998)
45. Vercauteren, F.: Optimal pairings. Cryptology ePrint Archive, Report 2008/096 (2008)
46. Washington, L.C.: Elliptic Curves - Number Theory and Cryptography, 2nd edn. CRC Press, Boca Raton (2008)