8. References
8. Références
8.1. Références normatives
[RFC2119]
Bradner, S., « Key words for use in RFCs to Indicate Requirement Levels », BCP 14, RFC 2119, DOI 10.17487/RFC2119, mars 1997, <http://www.rfc-editor.org/info/rfc2119>.
8.2. Références informatives
[brainpool]
ECC Brainpool, « ECC Brainpool Standard Curves and Curve Generation », octobre 2005, <http://www.ecc-brainpool.org/download/Domain-parameters.pdf>.
[bruteforce]
Bernstein, D., « Understanding brute force », avril 2005, <http://cr.yp.to/snuffle/bruteforce-20050425.pdf>.
[curve25519]
Bernstein, D., « Curve25519: new Diffie-Hellman speed records », 2006, <http://www.iacr.org/cryptodb/archive/2006/PKC/3351/3351.pdf>.
[ed25519]
Bernstein, D., Duif, N., Lange, T., Schwabe, P., et B. Yang, « High-Speed High-Security Signatures », 2011, <http://link.springer.com/chapter/10.1007/978-3-642-23951-9_9>.
[goldilocks]
Hamburg, M., « Ed448-Goldilocks, a new elliptic curve », 2015, <http://eprint.iacr.org/2015/625.pdf>.
[montgomery]
Montgomery, P., « Speeding the Pollard and Elliptic Curve Methods of Factorization », janvier 1987, <http://www.ams.org/journals/mcom/1987-48-177/S0025-5718-1987-0866113-7/S0025-5718-1987-0866113-7.pdf>.
[NIST]
National Institute of Standards, « Recommended Elliptic Curves for Federal Government Use », juillet 1999, <http://csrc.nist.gov/groups/ST/toolkit/documents/dss/NISTReCur.pdf>.
[reducing]
Menezes, A., Okamoto, T., et S. Vanstone, « Reducing elliptic curve logarithms to logarithms in a finite field », DOI 10.1109/18.259647, 1993, <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=259647>.
[RFC6090]
McGrew, D., Igoe, K., et M. Salter, « Fundamental Elliptic Curve Cryptography Algorithms », RFC 6090, DOI 10.17487/RFC6090, février 2011, <http://www.rfc-editor.org/info/rfc6090>.
[safecurves]
Bernstein, D. et T. Lange, « SafeCurves: choosing safe curves for elliptic-curve cryptography », oct. 2013, <http://safecurves.cr.yp.to/>.
[satoh]
Satoh, T. et K. Araki, « Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves », 1998.
[SEC1]
Certicom Research, « SEC 1: Elliptic Curve Cryptography », septembre 2000, <http://www.secg.org/sec1-v2.pdf>.
[semaev]
Semaev, I., « Evaluation of discrete logarithms on some elliptic curves », 1998, <http://www.ams.org/journals/mcom/1998-67-221/S0025-5718-98-00887-4/S0025-5718-98-00887-4.pdf>.
[smart]
Smart, N., « The Discrete Logarithm Problem on Elliptic Curves of Trace One », 1999, <http://www.hpl.hp.com/techreports/97/HPL-97-128.pdf>.