A GF(24m) inverter and its application in a reconfigurable Tate pairing processor

Proceedings of the 2006 IEEE International Conference on Reconfigurable Computing and FPGA's, ReConFig 2006

Volumn , Issue , 2006, Pages 158-167

  Keller, Maurice ^a   Ronan, Robert ^a   Marnane, William ^a   Murphy, Colin ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL CONFERENCES; RE CONFIGURABLE COMPUTING (RCC);

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 46449102758     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RECONF.2006.307766     Document Type: Conference Paper

References (18)

1. Celoxica rc2000. http://www.celoxica.com/products/rc2000/default.asp.
2. K. Araki, I. Fujita, and M. Morisue. Fast inverters over finite fields based on Euclids algorithm. Trans. Inst. Electronics, Information and Communication Engineers E, E72:1230-1234, 1989.
3. P. S. L. M. Barreto, S. Galbraith, C. O'hEigeartaigh, and M. Scott. Efficient pairing computation on supersingular abelian varieties, http://eprint.iacr.org/2004/375, Jan. 2004.
4. P. S. L. M. Barreto. H. Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Proc. 22nd Annual International Cryptology Conference (CRYPTO'02), pages 354-368, Santa Barbara, California. USA, Aug. 2002. LNCS 2442, Springer-Verlag.
5. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. SIAM J. of Computing, 32(3):586-615, 2003.
6. R. Dutta, R. Barua, and P. Sarkar. Pairing-based cryptographic protocols: A survey. http://eprint.iacr.org/2004/064, Oct. 2004.
7. p -x + d. In Proc. 9th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '03), pages 111-123, Taipei, Taiwan, Nov. 2003. LNCS 2894, Springer-Verlag.
8. S. D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In Proc. Fifth Algorithmic Number Theory Symp. (ANTS-V), pages 324-337, Sydney. Australia, July 2002. LNCS 2369. Springer-Verlag.
9. m) using normal bases. Information and Computation, 78:171-177, 1988.
10. m) Tate pairing architecture. In Proc. International Workshop on Applied Reconfigurable Computing (ARC2006), pages 358-369. Delft, The Netherlands, Mar. 2006. LNCS 3985, Springer-Verlag.
11. 4m) multiplier for use in pairing based cryptosystems. In Proc. International Conference on Field Programmable Logic and Applications 2005 (FPL 2005), pages 594-597, Tampere. Finland, Aug. 2005. IEEE.
12. T. Kerins, W. P. Marnane, E. M. Popovici, and P. S. L. M. Barreto. Hardware accelerators for pairing based cryptosystems. IEE Proceedings on Information Security, 152(1):47-56, October 2005.
13. D. Knuth. The Art of Computer Programming: Seminumerical Algorithms, volume 2. Addison-Wesley, second edition, 1981.
14. n). In Proc. Third International Workshop on Practice and Theory in Public Key Cryptography (PKC2000), pages 405-421, Melbourne, Australia, Jan. 2000. LNCS 1751, Springer-Verlag.
15. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers. 1993.
16. R. Ronan, C. O'hEigeartaigh, C. Murphy, M. Scott, T. Kerins, and W. P. Marnane. An embedded processor for a pairing-based cryptosystem. In Third International Conference on Information Technology: New Generations, 2006 (ITNG 2006), pages 192-197. IEEE, Apr. 2006.
17. S. C. Shantz. From Euclid's GCD to montgomery multiplication to the great divide. Technical Report TR-2001-95. Sun Microsystems, 2001.
18. L. Song and K. Parhi. Low energy digit-serial/parallel finite field multipliers. Kulwer Journal of VLSI Signal Processing Systems, 19(2): 149-166, 1998.