The Explicit Computations of Tate Pairing in Projective Coordinates over Characteristic Three
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The secure implementation of pairing-based cryptographic algorithms is a very important issue when constructing the resource constrained device such as smart card to prevent from the side channel attack. Recently, there have been variously proposed detection methods from these attacks. In this paper,we present a countermeasure of eta-pairing algorithm in characteristic three used by projective coordinate systems. We also provide not only the explicit formulas for alternative projective coordinates of eta pairing in characteristic three but also the computational costs behind proposed algorithms.
Abstract
The secure implementation of pairing-based cryptographic algorithms is a very important issue when constructing the resource constrained device such as smart card to prevent from the side channel attack. Recently, there have been variously proposed detection methods from these attacks. In this paper,we present a countermeasure of eta-pairing algorithm in characteristic three used by projective coordinate systems. We also provide not only the explicit formulas for alternative projective coordinates of eta pairing in characteristic three but also the computational costs behind proposed algorithms.
참고문헌 (23)
- P. Barreto, "Efficient pairing computation on supersingular abelian varieties", Des. Codes Cryptogr., 42(3), pp.239~271 (2007), Springer-Verlag
- P. Barreto, "Efficient algorithms for pairing-based cryptosystems", CRYPTO 2002, 통권 : 2442, pp.354~368 (2002)
- G. Bertoni, "Parallel hardware Ar-chitechures for the Cryptographic Tate Pairing", Preceedings of the Third Inter-national Conference on Information Technology: New Generations (ITNG'06), pp.186~191 (2006)
- "G. M. Bertoni, L. Chen, P. Fragneto, K. A. Harrison, G. Pelosi, Computing tate pairing on smartcards, Abailable from", ~
- D. Boneh, "Identity-Based Encryption from the Weil Pairing", Pro-ceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, 통권 : 2139, pp.213~229 (2001), Springer-Verlag
- D. Boneh, "Collusion resistant brodadcast encryption with short ciphertexts and private keys", in CRYPTO 2005, 통권 : 3621, pp.258~275 (2005)
- S. Chatterjee, "Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields", ICISC 2004, 통권 : 3506, pp.168~181 (2005)
- J. C. Choon, "An identity-Based Signature from Gap Diffie-Hellman Groups", PKC 2003, 통권 : 2567, pp.18~30 (2002), Springer
- J. S. Coron, "Resistance Against Differential Power Analysis for Elliptic Curve Cryptosystems", Cryptographic Hardware and Embedded Systems, 통권 : 1717, pp.292~302 (1999)
- A. J. Devegili, "Implementing Cryptographic Pairings over Barreto-Naehring Curves", 통권 : 4575, pp.1611~3349 (2007), Springer-Verlag
- I. M. Duursma, "Tate pairing implementation for hyperelliptic curves y2 = xp - x + d", In Advances in Cryptology - Asiacrypt 2003, 통권 : 2894, pp.111~123 (2003), Springer-Verlag
- S. Galbraith, "Implementing the Tate pairing", ANTS V, 통권 : 2369, pp.324~337 (2002)
- "ID based Cryptography and Smartcards"[URL]
- F. Hess, "Exponent group signature schemes and efficient identity based signa-ture schemes based on pairing", SAC 2002, 통권 : 2595, pp.310~324 (2002)
- F. Hess, "The Eta Pairing Revisited", IEEE Trans. Information Theory, 52(10), pp.4595~4602 (2006)
- T. Izu, "Efficient Computations of the Tate Pairing for the Large MOV Degrees", ICISC 2002, 통권 : 2587, pp.283~297 (2003)
- Tae Hyun Kim, "Power Analysis Attacks and Countermeasures on ηT Pairing over Binary Fields", ETRI Journal, 30(1), pp.68~80 (2008), 한국전자통신연구원
- S. Kwon, "Efficient tate pairing computation for supersingular elliptic curves over binary ¯elds", ACISP, 통권 : 3574, pp.134~145 (2005), Springer-Verlag
- V. S. Miller, "The Weil pairing, and its efficient calculation", Journal of Cryptol-ogy, 17(4), pp.235~261 (2004)
- D. Page, "A Fault Attack on Pairing Based Cryptography", IEEE Trans. on Computers, 55(9), pp.1075~1080 (2006)
- R. Ronan, "An Embedded Processor for a Pairing-Based Cryptosystem", Proceedings of the Third International Conference on Information Technology: New Generations (ITNG'06), pp.192~197 (2006)
- Implementating Cryptographic Pairings on Smartcards, Cryptography ePrint Archive, "M. Scott", Report 2006, 2006, eport 2006[DOI]
- A. Shamir, "Identity-based Cryptosystems and Signature Schemes", Proceedings of CRYPTO'84, 통권 : 196, pp.47~53 (1984), Springer-Verlag