A flexible processor for the characteristic 3 ηT pairing

International Journal of High Performance Systems Architecture

Volumn 1, Issue 2, 2007, Pages 79-88

  Ronan, Robert ^a   Murphy, Colin ^a   Kerins, Tim ^a   Ó hÉigeartaigh, Colm ^b   Barreto, Paulo S L M ^c  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b DUBLIN CITY UNIVERSITY   (Ireland)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

characteristic 3; elliptic curve; reconfigurable processor; pairing

Indexed keywords

EID: 52149093742     PISSN: 17516528     EISSN: 17516536     Source Type: Journal    
DOI: 10.1504/IJHPSA.2007.015393     Document Type: Article

References (16)

1. Barreto, P.S.L.M., Galbraith, S., hÉigeartaigh, C. Ó. and Scott, M. (2007) ‘Efficient pairing computation on supersingular abelian varieties’, Designs, Codes and Cryptography, Vol. 42, No. 3, pp.239–271.
2. Barreto, P.S.L.M., Kim, H.Y., Lynn, B. and Scott, M. (2002) ‘Efficient algorithms for pairing-based cryptosystems’, Advances in Cryptology – Crypto’2002, Vol. 2442 of Lecture Notes in Computer Science, Springer-Verlag, pp.354–368.
3. Bertoni, G., Breveglieri, L., Fragneto, P. and Pelosi, G. (2006) ‘Parallel hardware architectures for the Cryptographic Tate pairing’, Information Technology: New Generations, 2006, IEEE Computer Society, pp.186–191.
4. m) arithmetic architectures for cryptographic applications’, Topics in Cryptology – CT RSA 2003, Vol. 2612 of Lecture Notes in Computer Science, Springer-Verlag, pp.158–175.
5. T pairing calculation in characteristic three and its hardware implementation’, Cryptology ePrint Archive, Report 2006/327, Available at: http://eprint.iacr.org/2006/327.
6. Dutta, R., Barua, R. and Sarkar, P. (2004) ‘Pairing-based cryptography: a survey’, Cryptology ePrint Archive, Report 2004/064, Available at: http://eprint.iacr.org/2004/064.
7. p — x + d’, Advances in Cryptology Asiacrypt’2003, Vol. 2894 of Lecture Notes in Computer Science, Springer-Verlag, pp.111—123.
8. Frey, G. and Rück, H-G. (1994) ‘A remark concerning m -divisibility and the discrete logarithm problem in the divisor class group of curves’, Math. Comp., Vol. 52, pp.865–874.
9. Galbraith, S., Harrison, K. and Soldera, D. (2002) ‘Implementing the Tate pairing’, Algorithmic Number Theory ANTS V, Vol. 2369 of Lecture Notes in Computer Science, Springer-Verlag, pp.324–337.
10. Grabher, P. and Page, D. (2005) ‘Hardware acceleration of the Tate pairing in characteristic 3’, Cryptographic Hardware and Embedded Systems (CHES), Vol. 3659 of Lecture Notes in Computer Science, Springer-Verlag, pp.398–411.
11. Kerins, T., Marnane, W., Popovici, E. and Barreto, P. (2005) ‘Efficient hardware for the Tate pairing calculation in characteristic 3’, Cryptographic Hardware and Embedded Systems (CHES), Vol. 3659 of LNCS, Springer, pp.412–426.
12. Kerins, T., Popovici, E.M. and Marnane, W.P. (2004) ‘Algorithms and architectures for use in FPGA implementations of identity based encryption schemes’, Field Programmable Technology, pp.74–83.
13. Kwon, S. (2005) ‘Efficient Tate pairing computation for elliptic curves over binary fields’, Australasian Conference on Information Security and Privacy – ACISP 2005, Vol. 3574 of Lecture Notes in Computer Science, Springer-Verlag, pp.134–145.
14. Miller, V.S. (1986) ‘Short programs for functions on curves’, Unpublished manuscript, Available at: http://crypto.stanford.edu/miller/miller.pdf.
15. Song, L. and Parhi, K. (1997) ‘Low-energy digit-serial/parallel finite field multipliers’, Journal of VLSI Signal Processing Systems, Vol. 2, No. 22, pp.1–17.
16. Verheul, E. (2001) ‘Evidence that XTR is more secure than supersingular elliptic curve cryptosystems’, Advances in Cryptology – Eurocrypt’2001, Vol. 2045 of Lecture Notes in Computer Science, Springer-Verlag, pp.195–210.