Implementation of cryptosystems based on tate pairing

Journal of Computer Science and Technology

Volumn 20, Issue 2, 2005, Pages 264-269

  Hu, Lei ^a   Dong, Jun Wu ^b   Pei, Ding Yi ^a  

^a GRADUATE SCHOOL   (China)

^b GUANGZHOU UNIVERSITY   (China)

Author keywords

Elliptic curve; Identity based cryptosystem; Implementation; Tate pairing

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTER GRAPHICS; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

ELLIPTIC CURVE; IDENTITY-BASED CRYPTOSYSTEM; IMPLEMENTATION; TATE PAIRING;

CRYPTOGRAPHY;

EID: 18244402163     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-005-0264-1     Document Type: Conference Paper

References (17)

1. Shamir A. Identity based cryptosystems and signature schemes. In Advance in Cryptology-Crypto'84, Blakley GR, Chaum D (eds.), Berlin/Heidelberg: Springer-Verlag, 1985, pp.47-53.
2. Boneh D, Franklin M. Identity based encryption from the Weil pairing. In Advance in Cryptology-Crypto'2001, Kilian J (ed.), Berlin/Heidelberg: Springer-Verlag, 2001, pp.213-229.
3. Tao R, Chen S. An implementation of identity-based cryptosystems and signature schemes by finite automation public key cryptosystems. In Advance in Cryptology-Chinacrypt'92, Tao R, Li X, Pei D (eds.), Beijing: Science Press, 1992, pp.87-104. (in Chinese)
4. Sakai R, Ohgishi K, Kasahara M. Cryptosystems based on pairing. In Symposium on Cryptography and Information Security-SCIS'2000, Okinawa, Japan, Jan. 2000, pp.26-28.
5. Joux A. A one-round protocol for tripartite diffie-hellman. In Algorithm Number Theory Symposium-ANTS-IV, Bosma W (ed.), Berlin/Heidelberg: Springer-Verlag, 2000, pp.385-394.
6. Boneh D, Silverberg A. Applications of multilinear forms to cryptography. In Topics in Algebraic and Noncommutative Geometry-Proceedings in Memory of Ruth Michler, Melles G, Brasselet J, Kennedy G et al. (eds.), Contemporary Mathematics Series of American Mathematical Society, 2003, 324: 71-90.
7. Menezes A J, Okamoto T, Vanstone S A. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Information Theory, 1993, 39(5): 1639-1646.
8. Frey G, Ruck H G. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation, 1994, 62(206): 865-874.
9. Miyaji A, Nakabayashi M, Takano S. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals, 2001, E84-A(5): 1234-1243.
10. Dupont R, Enge A, Morain F. Building curves with arbitrary small MOV degree over finite prime fields. Available at http://ePrint.iacr.org/2002/094 (Cryptology ePrint Archive, Report 2002/094).
11. Barreto P S L M, Lynn B, Scott M. Constructing elliptic curves with prescribed embedding degrees. In Third Workshop on Security in Communication Networks - SCN'2002, Yung M (ed.), Lecture Notes in Computer Science 2576, Springer-Verlag, 2003, pp.257-267.
12. Barreto P S L M, Kim H, Lynn B, Scott M. Efficient algorithms for pairing based cryptosystems. In Advance in Cryptology-Crypto'2002, Yung M (ed.), Berlin/Heidelberg: Springer-Verlag, 2002, pp.354-368.
13. Galbraith S D, Harrison K, Soldera D. Implementing the Tate pairing. In Algorithm Number Theory Symposium-ANTS-V, Kohel D R (ed.), Berlin/Heidelberg: Springer-Verlag, 2002, pp.324-337.
14. Harasawa R, Shikata J, Suzuki J, Imai H. Comparing the MOV and FR reductions in elliptic curve cryptography. In Advance in Cryptology- Eurocrypto'97, Fumy W (ed.), Berlin/Heidelberg, Springer-Verlag, 1997, pp. 190-205.
15. Verheul E R. Evidence that XTR is more secure than supersingular elliptic curve cryptoSystems. In Advance in Cryptology-Eurocrypt'2001, Pfitzmann B (ed.), Berlin/Heidelberg: Springer-Verlag, 2001, pp.195-210.
16. Joux A. The Weil and Tate pairings as building blocks for public key cryptosystems. In Algorithm Number Theory Symposium-ANTS-V, Kohel D R (ed.), Berlin/Heidelberg: Springer-Verlag, 2002, pp.20-32.
17. Miller V. Short programs for functions on curves. Unpublished manuscript, 1986. Available at http://crypto.Stanford.edu.cn/miller/miller.pdf