An embedded processor for a pairing-based cryptosystem

Proceedings - Third International Conference onInformation Technology: New Generations, ITNG 2006

Volumn 2006, Issue , 2006, Pages 192-197

  Ronald, Robert ^a   Heigeartaigh, Colm O ^b   Murphy, Colin ^a   Scott, Michael ^b   Kerins, Tim ^a   Marnane, W P ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

pairing; Characteristic 2; Dedicated processor; Genus 2 hyperelliptic; Pairing based cryptosystem

Indexed keywords

COMPUTATION THEORY; COMPUTER ARCHITECTURE; EMBEDDED SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; SOFTWARE PROTOTYPING;

BILINEAR PAIRINGS; DEDICATED PROCESSORS; GENUS 2 HYPERELLIPTIC; PAIRING-BASED CRYPTOSYSTEMS;

PROGRAM PROCESSORS;

EID: 33750829177     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2006.29     Document Type: Conference Paper

References (15)

1. P. S. L. M. Barreto, H.Y. Kim, B. Lynn, and M. Scott. Efficient implementation of pairing based cryptosystems. In Advances in Cryptology - CRYPTO 2002, volume 2442 of LNCS, pages 354-368. Springer, 2002.
2. P.S.L.M. Barreto, S. Galbraith, C. O hEigeartaigh, and M. Scott. Efficient Pairing Computation on Supersingular Abelian Varieties. Report 375/2004, Cryptology ePrint Archive, http://eprint.iacr.org/2004/375, 2004.
3. m). IEEE Transactions on Computers, 42:1010-1015, 1993.
4. R. Dutta, R.Barua, and P. Sarkar. Pairing-Based Cryptography: A Survey. Report 2004/064, Cryptology ePrint Archive, http://eprint.iacr.org/2004/64, 2004.
5. p - x + d. In Advances in Cryptology - ASIACRYPT 2003, volume 2894, pages 111-123. Springer, 2003.
6. S. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate pairing. In Algorithmic Number Theory Symposium - ANTS V, volume 2369 of LNCS, pages 324-337. Springer, 2002.
7. P. Grabber and D. Page. Hardware Acceleration of the Tate Pairing in Characteristic 3. In Cryptographic Hardware and Embedded Systems (CHES), volume 3659 of LNCS, pages 398-411. Springer, 2005.
8. J. Guajardo and C. Paar. Efficient Algorithms for Elliptic Curve Cryptosystems. In Advances in Cryptology - CRYPTO 1997, volume 1294 of LNCS, pages 342-356. Springer, 1997.
9. T. Kerins, W.P. Marnane, E.M. Popovici, and P.S.L.M. Barreto. Efficient Hardware for the Tate Pairing Calculation in Characteristic 3. In Cryptographic Hardware and Embedded Systems (CHES), volume 3659 of LNCS, pages 412-426. Springer, 2005.
10. n). In PKC 2000, volume 1751 of LNCS, pages 405-421. Springer, 2000.
11. A.J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publisher, 1993.
12. m). In Cryptographic Hardware and Embedded Systems (CHES), volume 1965 of LNCS, pages 41-56. Springer, 2000.
13. m). In Advances in Cryptology - EUROCRYPT 1997, volume 1233 of LNCS, pages 363-378. Springer, 1997.
14. L. Song and K.K. Parhi. Low-Energy Digit-Serial/Parallel Finite Field Multipliers. Journal of VLSI Signal Processing Systems, 2(22):1-17, 1997.
15. E. R. Verhuel. Evidence that XTR is more secure than supersingular elliptic curve Cryptosystems. In Advances in Cryptology - EUROCRYPT 2001, volume 2045 of LNCS, pages 195-210. Springer, 2001.