Radix-r non-adjacent form and its application to pairing-based cryptosystem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 1, 2006, Pages 115-123

  Takagi, Tsuyoshi ^a,d   Reis Jr , David ^b   Yen, Sung Ming ^c,e   Wu, Bo Ching ^c  

^a FUTURE UNIVERSITY HAKODATE   (Japan)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^d International Association for Cryptologic Research IACR   (Japan)

^e Laboratory of Cryptography and Information Security (LCIS)   (Taiwan)

Author keywords

Elliptic curve cryptosystem; Non adjacent form; Pairing based cryptosystem; Radix r presentation; Signed window method

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTER SCIENCE; ELECTRONICS ENGINEERING; INFORMATION THEORY;

ELLIPTIC CURVE CRYPTOSYSTEMS; NON-ADJACENT FORMS; PAIRING BASED CRYPTOSYSTEMS; RADIX-R PRESENTATIONS (RNAF); SIGNED WINDOW METHOD;

CRYPTOGRAPHY;

EID: 32244445656     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.1.115     Document Type: Article

References (23)

1. P. Barreto, H. Kim, B. Lynn, and M. Scott, "Efficient algorithms for pairing-based cryptosystems," CRYPTO2002, LNCS 2442, pp.354-368, 2002.
2. m) arithmetic architectures for cryptographic applications," CT-RSA2003, LNCS 2612, pp.158-175, 2003.
3. I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, Cambridge University Press, 1999.
4. D. Boneh and M. Franklin, "Identity based encryption from the Weil pairing," SIAM J. Comput., vol.32, no.3, pp.586-615, 2001.
5. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the Weil pairing," ASIACRYPT2001, LNCS 2248, pp.514-532, 2001.
6. W. Clark and J. Liang, "On arithmetic weight for a general radix representation of integers," IEEE Trans. Inf. Theory, vol.IT-19, no.6, pp.823-826, 1973.
7. p - x + d," ASIACRYPT2003, LNCS 2894, pp.111-123, 2003.
8. S. Galbraith, K. Harrison, and D. Soldera, "Implementing the Tate pairing," ANTS V, LNCS 2369, pp.324-337, Springer-Verlag, 2002.
9. R. Granger, D. Page, and M. Stam, "On small characteristic algebraic tori in pairing-based cryptography," Cryptology ePrint Archive: Report 2004/132.
10. D. Gordon, "A survey of fast exponentiation methods," J. Algorithms, vol.27, pp.129-146, 1998.
11. K. Harrison, D. Page, and N. Smart, "Software implementation of finite fields of characteristic three," LMS J. Comput. Math., vol.5, pp.181-193, 2002
12. IEEE P1363, Standard Specifications for Public-Key Cryptography, 2000.
13. S. Kwon, "Efficient Tate pairing computation for supersingular elliptic curves over binary fields," Cryptology ePrint Archive, Report 2004/303.
14. A. Joux, "A one round protocol for tripartite Diffie-Hellman," ANTS V, LNCS 1838, pp.385-394, 2000.
15. A. Joux, "The Weil and Tate pairings as building blocks for public key cryptosystems (survey)," ANTS V, LNCS 2369, pp.20-32, 2002.
16. M. Joye and S.-M. Yen, "New minimal modified radix-r representation with applications to smart cards," PKC2002, LNCS 2274, pp.375-384, 2002.
17. A. Miyaji, T. Ono, and H. Cohen, "Efficient elliptic curve exponentiation," ICICS'97, LNCS 1334, pp.282-291, 1997.
18. D. Page and N. Smart, "Hardware implementation of finite fields of characteristic three," CHES2002, LNCS 2523, pp.529-539, 2002.
19. B. Phillips and N. Burgess, "Minimal weight digit set conversions," IEEE Trans. Comput., vol.53, no.6, pp.666-677, 2004.
20. N. Smart and J. Westwood, "Point multiplication on ordinary elliptic curves over fields of characteristic three," Appl. Algebra Eng. Commun. Comput., vol.13, no.6, pp.485-497, 2003.
21. J. Solinas, "Efficient arithmetic on Koblitz curves," Des. Codes Cryptogr., vol.19, no.2/3, pp.195-249, 2000.
22. E.G. Thurber, "On addition chains l(mn) ≤ l(n)-b and lower bounds for c(r)," Duke Math. J., vol.40, pp.907-913, 1973.
23. K. Harrison, D. Page, and N. Smart, "Software implementation of finite fields of characteristic 3," LMSJ Comput. Math., vol.5, pp. 181-193, 2002.