Elliptic-curve Diffie–Hellman (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Elliptic-curve Diffie–Hellman" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

3springer.com

274^th place

309^th place

2web.archive.org

1^st place

2ams.org

451^st place

277^th place

2iacr.org

5,032^nd place

3,357^th place

2github.com

383^rd place

320^th place

2yp.to

low place

8,415^th place

1nist.gov

355^th place

454^th place

1secg.org

low place

1nsa.gov

7,043^rd place

4,687^th place

1ruhr-uni-bochum.de

low place

1arxiv.org

69^th place

59^th place

1linecorp.com

low place

ams.org

Montgomery, Peter L. "Speeding the Pollard and elliptic curve methods of factorization" (PDF). Mathematics of Computation, 48(177):243–264, 1987.
Pollard, John M. "Monte Carlo methods for index computation mod p" (PDF). Mathematics of Computation, 32:918–924, 1978.

arxiv.org

Costello, Craig; Smith, Benjamin (September 2018). "Montgomery curves and their arithmetic - the case of large characteristic fields". Journal of Cryptographic Engineering. 8 (3). J. Cryptographic Engineering, 8(3):227–240, 2018.: 227–240. arXiv:1703.01863. doi:10.1007/s13389-017-0157-6.

doi.org

Costello, Craig; Smith, Benjamin (September 2018). "Montgomery curves and their arithmetic - the case of large characteristic fields". Journal of Cryptographic Engineering. 8 (3). J. Cryptographic Engineering, 8(3):227–240, 2018.: 227–240. arXiv:1703.01863. doi:10.1007/s13389-017-0157-6.
Bernstein, Daniel J. (2006). "Curve25519: New Diffie-Hellman Speed Records". Public Key Cryptography - PKC 2006. Lecture Notes in Computer Science. Vol. 3958. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds) Public Key Cryptography - PKC 2006. Lecture Notes in Computer Science, vol 3958. Springer, Berlin, Heidelberg. pp. 207–228. doi:10.1007/11745853_14. ISBN 978-3-540-33851-2.
Miller, Victor S. (1986). "Use of elliptic curves in cryptography". Advances in Cryptology — CRYPTO '85 Proceedings. Lecture Notes in Computer Science. Vol. 218. In Advances in Cryptology - CRYPTO’85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings, pages 417–426. Springer Berlin Heidelberg, 1985. pp. 417–426. doi:10.1007/3-540-39799-X_31. ISBN 978-3-540-16463-0.
Nath, Kaushik; Sarkar, Palash (2022). "Security and Efficiency Trade-offs for Elliptic Curve Diffie-Hellman at the 128- and 224-bit Security Levels". Journal of Cryptographic Engineering. 12. J Cryptogr Eng 12, 107–121 (2022): 107–121. doi:10.1007/s13389-021-00261-y., Code available at https://github.com/kn-cs/x25519
Nath, Kaushik; Sarkar, Palash (2020). "Efficient Elliptic Curve Diffie-Hellman Computation at the 256-bit Security Level". IET Information Security. 14 (6): 633–640. doi:10.1049/iet-ifs.2019.0620., Code available at https://github.com/kn-cs/mont256-dh and https://github.com/kn-cs/mont256-vec

github.com

Nath, Kaushik; Sarkar, Palash (2022). "Security and Efficiency Trade-offs for Elliptic Curve Diffie-Hellman at the 128- and 224-bit Security Levels". Journal of Cryptographic Engineering. 12. J Cryptogr Eng 12, 107–121 (2022): 107–121. doi:10.1007/s13389-021-00261-y., Code available at https://github.com/kn-cs/x25519
Nath, Kaushik; Sarkar, Palash (2020). "Efficient Elliptic Curve Diffie-Hellman Computation at the 256-bit Security Level". IET Information Security. 14 (6): 633–640. doi:10.1049/iet-ifs.2019.0620., Code available at https://github.com/kn-cs/mont256-dh and https://github.com/kn-cs/mont256-vec

iacr.org

eprint.iacr.org

Bernstein, Daniel J.; Lange, Tanja (2017). "Montgomery curves and the Montgomery ladder". In Joppe W. Bos and Arjen K. Lenstra, editors, Topics in Computational Number Theory inspired by Peter L. Montgomery, pages 82–115. Cambridge University Press, 2017.
Hamburg, Mike (2015). "Ed448-goldilocks, a new elliptic curve". ACR Cryptology ePrint Archive, 2015:625, 2015.

linecorp.com

engineering.linecorp.com

JI (13 October 2015). "New generation of safe messaging: "Letter Sealing"". LINE Engineers' Blog. LINE Corporation. Archived from the original on 1 February 2019. Retrieved 5 February 2018.

nist.gov

csrc.nist.gov

NIST, Special Publication 800-56A, Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography, March, 2006.

nsa.gov

NSA Suite B Cryptography, Suite B Implementers' Guide to NIST SP 800-56A Archived 2016-03-06 at the Wayback Machine, July 28, 2009.

ruhr-uni-bochum.de

nds.ruhr-uni-bochum.de

Tibor Jager; Jorg Schwenk; Juraj Somorovsky (2015-09-04). "Practical Invalid Curve Attacks on TLS-ECDH" (PDF). European Symposium on Research in Computer Security (ESORICS'15).

secg.org

Certicom Research, Standards for efficient cryptography, SEC 1: Elliptic Curve Cryptography, Version 2.0, May 21, 2009.

springer.com

link.springer.com

Costello, Craig; Smith, Benjamin (September 2018). "Montgomery curves and their arithmetic - the case of large characteristic fields". Journal of Cryptographic Engineering. 8 (3). J. Cryptographic Engineering, 8(3):227–240, 2018.: 227–240. arXiv:1703.01863. doi:10.1007/s13389-017-0157-6.
Miller, Victor S. (1986). "Use of elliptic curves in cryptography". Advances in Cryptology — CRYPTO '85 Proceedings. Lecture Notes in Computer Science. Vol. 218. In Advances in Cryptology - CRYPTO’85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings, pages 417–426. Springer Berlin Heidelberg, 1985. pp. 417–426. doi:10.1007/3-540-39799-X_31. ISBN 978-3-540-16463-0.
Nath, Kaushik; Sarkar, Palash (2022). "Security and Efficiency Trade-offs for Elliptic Curve Diffie-Hellman at the 128- and 224-bit Security Levels". Journal of Cryptographic Engineering. 12. J Cryptogr Eng 12, 107–121 (2022): 107–121. doi:10.1007/s13389-021-00261-y., Code available at https://github.com/kn-cs/x25519

web.archive.org

NSA Suite B Cryptography, Suite B Implementers' Guide to NIST SP 800-56A Archived 2016-03-06 at the Wayback Machine, July 28, 2009.
JI (13 October 2015). "New generation of safe messaging: "Letter Sealing"". LINE Engineers' Blog. LINE Corporation. Archived from the original on 1 February 2019. Retrieved 5 February 2018.

yp.to

cr.yp.to

Bernstein, Daniel J. "Can we avoid tests for zero in fast elliptic-curve arithmetic?" (PDF).

safecurves.cr.yp.to

Bernstein, Daniel J.; Lange, Tanja. "Safecurves: choosing safe curves for elliptic- curve cryptography". Retrieved April 15, 2024.