Fast Implementation of Curve25519 Using AVX2
暂无分享,去创建一个
[1] T. Itoh,et al. A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..
[2] Daniel J. Bernstein,et al. Curve25519: New Diffie-Hellman Speed Records , 2006, Public Key Cryptography.
[3] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .
[4] Michael Scott,et al. Faster ECC over \mathbb F_2^521-1 , 2015, Public Key Cryptography.
[5] Paulo S. L. M. Barreto,et al. A note on high-security general-purpose elliptic curves , 2013, IACR Cryptol. ePrint Arch..
[6] Torbjrn Granlund,et al. GNU MP 6.0 Multiple Precision Arithmetic Library , 2015 .
[7] Michael Scott,et al. Faster ECC over 픽2521-1 , 2014, IACR Cryptol. ePrint Arch..
[8] Peter Schwabe,et al. NEON Crypto , 2012, CHES.
[9] Craig Costello,et al. Selecting elliptic curves for cryptography: an efficiency and security analysis , 2016, Journal of Cryptographic Engineering.
[10] Tanja Lange,et al. Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .
[11] Michael Scott,et al. Faster ECC over F 2 521 -1 , 2015 .