Constructing Families of Pairing-Friendly Elliptic Curves
暂无分享,去创建一个
[1] R. Tennant. Algebra , 1941, Nature.
[2] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.
[3] François Morain. Building Elliptic Curves Modulo Large Primes , 1991, EUROCRYPT.
[4] Alfred Menezes,et al. Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.
[5] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .
[6] J. Neukirch. Algebraic Number Theory , 1999 .
[7] A. Miyaji,et al. New Explicit Conditions of Elliptic Curve Traces for FR-Reduction , 2001 .
[8] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[9] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[10] Antoine Joux,et al. A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.
[11] Paulo S. L. M. Barreto,et al. Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.
[12] A. Weng,et al. Elliptic Curves Suitable for Pairing Based Cryptography , 2005, Des. Codes Cryptogr..
[13] Steven D. Galbraith,et al. Ordinary abelian varieties having small embedding degree , 2007, Finite Fields Their Appl..