FPGA implementation of a GF(2m) tate pairing architecture

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

Volumn 3985 LNCS, Issue , 2006, Pages 358-369

  Keller, Maurice ^a   Kerins, Tim ^a   Crowe, Francis ^a   Marnane, William ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL OPERATORS; PROGRAM PROCESSORS; SECURITY SYSTEMS;

SCALAR MULTIPLICATION; SECURITY LEVELS;

FIELD PROGRAMMABLE GATE ARRAYS;

EID: 33749017046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11802839_44     Document Type: Conference Paper

References (15)

1. R. Dutta, R. Barua and P. Sarkar: Pairing-Based Cryptographic Protocols: A Survey. Cryptology ePrint Archive, Report 064/2004, (2004)
2. D. Boneh and M. Franklin: Identity Based Encryption from the Weil Pairing. SIAM J. of Computing, Vol. 32, No. 3, (2003) 586-615
3. th ACM Conference on Computer and Communications Security, (November 2005) 128-138
4. P. S. L. M. Barreto, H. Y. Kim, B. Lynn and M. Scott: Efficient Algorithms for Pairing-Based Cryptosystems. Proc. CRYPTO '02, (2002) 354-368
5. S. D. Galbraith, K. Harrison and D. Soldera: Implementing the Tate Pairing. Proc. Fifth Algorithmic Number Theory Symp. (ANTS-V), (2002) 324-337
6. p - x + d. Proc. ASIACRYPT '03, (2003) 111-123
7. P. S. L. M. Barreto, S. Galbraith, C. O'hEigeartaigh and M. Scott: Efficient Pairing Computation on Supersingular Abelian Varieties. Cryptology ePrint Archive, Report 375/2004, (2004)
8. Celoxica RC2000, http://www.celoxica.com/products/rc2000/default.asp
9. 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, Vol 152, No. 1, (October 2005) 47-56
10. R. Ronan, C. O'hEigeartaigh, C. Murphy, M. Scott, T. Kerins and W. P. Marnane: A Dedicated Processor for the eta Pairing. Cryptology ePrint Archive, Report 330/2005, (2005)
11. D. Knuth: The Art of Computer Programming: Seminumerical Algorithms. Vol 2, Second Edition, Addison-Wesley, (1981)
12. L. Song and K. Parhi: Low Energy Digit-Serial/Parallel Finite Field Multipliers. Kulwer Journal of VLSI Signal Processing Systems, Vol 19, No. 2, (1998) 149-166
13. S. C. Shantz: From Euclid's GCD to Montgomery Multiplication to the Great Divide. TR-2001-95, Technical Report, Sun Microsystems, (2001)
14. A. Karatsuba and Y. Ofman: Multiplication on Many-Digital Numbers by Automatic Computers. Translation in Physics-Doklady, Vol 7, (1963) 595-596
15. 4m) Multiplier for use in Pairing Based Cryptosystems. Proc. International Conference on Field Programmable Logic and Applications 2005, (August 2005) 594-597