Compression of Tate pairings on elliptic curves

被引：1
作者：
State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049, China [1 ]
机构：
[1] State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences
来源：
Ruan Jian Xue Bao | 2007年 / 7卷 / 1799-1805期
关键词：
Algebraic torus; Compressed Tate pairing; Elliptic curve; Identity based cryptosystem; Tate pairing;
D O I：
10.1360/jos181799
中图分类号：
学科分类号：
摘要：
In this paper, utilizing maps between cyclic groups contained in a finite field, two efficient methods for compressing a Tate pairing defined on a supersingular elliptic curve with prime characteristic p and MOV degree 3 are presented. They compress a pairing value from a string of length of 6logp bits to ones of 3logp and 2logp bits, respectively, and an implementation for both the compressed pairings makes use of the codes for the optimized algorithm of the original pairing and no new code is needed. Both the compressed pairings achieve the speed of the original implementation.
引用
收藏
页码：1799 / 1805
页数：6
相关论文
共 15 条
  • [1] Joux A., The weil and tate pairings as building blocks for public key cryptosystems, Algorithm Number Theory Symposium-ANTS-V, pp. 20-32, (2002)
  • [2] Canetti R., Halevi S., Katz J., A forward-secure public-key encryption scheme, Advances in Cryptology-EUROCRPYT 2003, pp. 255-271, (2003)
  • [3] Bohen D., Boyen X., Efficient selective-id secure identity based encryption without random oracles, Advances in Cryptology-EUROCRYPT 2004, pp. 223-238, (2004)
  • [4] Boneh D., Mironov I., Shoup V., A secure signature scheme from Biliear maps, The Cryptographers' Track at the RSA Conf. -CT-RSA 2003, pp. 98-110, (2001)
  • [5] Steinfeld R., Bull L., Wang H., Pieprzyk J., Universal designated-verifier signatures, Advances in Cryptology-ASIACRYPT 2003, pp. 523-542, (2003)
  • [6] Barreto P.S.L.M., Kim H., Lynn B., Scott M., Efficient algorithms for pairing based cryptosystems, Advance in Cryptology-Crypto 2002, pp. 354-368, (2002)
  • [7] Galbraith S.D., Harrison K., Soldera D., Implementing the tate pairing, Algorithm Number Theory Symposium-ANTS-V, pp. 324-337, (2002)
  • [8] Hu L., Dong J., Pei D., An implementation of cryptosystems Basedon tate pairing, Journal of Computer Science and Technology, 20, 2, pp. 264-269, (2005)
  • [9] Scott M., Barreto P., Compressed pairings, Advances in Cryptology-CRYPTO 2004, pp. 140-156, (2004)
  • [10] Granger R., Page D., Stam M., On small characteristic algebraic Tori in pairing-based cryptography
12