Efficient Algorithms for Pairing-Based Cryptosystems
作者： Paulo SLM Barreto , Hae Y Kim , Ben Lynn , Michael Scott , None
关键词:
摘要: … based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by … latter technique being also useful in contexts other than that of pairing-based cryptography. …
springer.com
core.ac.uk
springerlink.com参考文章(32)
Joseph H. Silverman, The Arithmetic of Elliptic Curves ,(1986)
Neal Koblitz, An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm international cryptology conference. pp. 327- 337 ,(1998) , 10.1007/BFB0055739
Steven D. Galbraith, Supersingular Curves in Cryptography international conference on the theory and application of cryptology and information security. pp. 495- 513 ,(2001) , 10.1007/3-540-45682-1_29
Henri Cohen, A Course in Computational Algebraic Number Theory ,(1993)
Preda Mihailescu, F Pappalardi, Elliptic Curves in Cryptography ,(1999)
N. Tzanakis, Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. The case of quartic equations Acta Arithmetica. ,vol. 75, pp. 165- 190 ,(1996) , 10.4064/AA-75-2-165-190
Steven D. Galbraith, Keith Harrison, David Soldera, Implementing the Tate Pairing algorithmic number theory symposium. pp. 324- 337 ,(2002) , 10.1007/3-540-45455-1_26
Antoine Joux, A One Round Protocol for Tripartite Diffie-Hellman algorithmic number theory symposium. ,vol. 1838, pp. 385- 394 ,(2000) , 10.1007/10722028_23
Karl Rubin, Alice Silverberg, Supersingular Abelian Varieties in Cryptology Advances in Cryptology — CRYPTO 2002. pp. 336- 353 ,(2002) , 10.1007/3-540-45708-9_22