Generating Pairing-Friendly Elliptic Curves Using Parameterized Families
暂无分享,去创建一个
[1] Annegret Weng,et al. Elliptic Curves Suitable for Pairing Based Cryptography , 2005, Des. Codes Cryptogr..
[2] A. Atkin,et al. ELLIPTIC CURVES AND PRIMALITY PROVING , 1993 .
[3] Michael Scott,et al. A Taxonomy of Pairing-Friendly Elliptic Curves , 2010, Journal of Cryptology.
[4] Alfred Menezes,et al. Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography , 2016, Mycrypt.
[5] Steven D. Galbraith,et al. Ordinary abelian varieties having small embedding degree , 2007, Finite Fields Their Appl..
[6] William E. Burr,et al. Recommendation for Key Management, Part 1: General (Revision 3) , 2006 .
[7] Razvan Barbulescu,et al. Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case , 2016, CRYPTO.
[8] Woo Sug Kang,et al. Pairing-Friendly Elliptic Curves With Various Discriminants , 2010, IACR Cryptol. ePrint Arch..
[9] Ken Nakamula,et al. Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials , 2008, Pairing.