Elliptic-curve cryptography (English Wikipedia)

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

refsWebsite

Global rank English rank

13web.archive.org

1^st place

11doi.org

2^nd place

6iacr.org

5,032^nd place

3,357^th place

6yp.to

low place

8,415^th place

4nist.gov

355^th place

454^th place

3semanticscholar.org

11^th place

8^th place

3nsa.gov

7,043^rd place

4,687^th place

2hp.com

3,975^th place

2,687^th place

2psu.edu

207^th place

136^th place

2nytimes.com

7^th place

1jstor.org

26^th place

20^th place

1ghostarchive.org

32^nd place

21^st place

1wired.com

193^rd place

152^nd place

1slashdot.org

5,701^st place

4,384^th place

1cryptome.org

low place

1emc.com

low place

1secg.org

low place

1ieee.org

652^nd place

515^th place

1harvard.edu

18^th place

17^th place

1epfl.ch

4,521^st place

4,877^th place

1certicom.com

low place

1ecc-challenge.info

low place

1austms.org.au

low place

1schneier.com

8,888^th place

6,276^th place

1arxiv.org

69^th place

59^th place

1f5.com

low place

1seclists.org

low place

arxiv.org

Roetteler, Martin; Naehrig, Michael; Svore, Krysta M.; Lauter, Kristin (2017). "Quantum resource estimates for computing elliptic curve discrete logarithms". arXiv:1706.06752 [quant-ph].

austms.org.au

anziamj.austms.org.au

Hitchcock, Y.; Dawson, E.; Clark, A.; Montague, P. (2002). "Implementing an efficient elliptic curve cryptosystem over GF(p) on a smart card" (PDF). ANZIAM Journal. 44. Archived from the original (PDF) on 2006-03-27.

certicom.com

"Certicom Announces Elliptic Curve Cryptography Challenge Winner". Certicom. April 27, 2004. Archived from the original on 2011-07-19.

cryptome.org

Commercial National Security Algorithm Suite and Quantum Computing FAQ U.S. National Security Agency, January 2016.

doi.org

Koblitz, N. (1987). "Elliptic curve cryptosystems". Mathematics of Computation. 48 (177): 203–209. doi:10.2307/2007884. JSTOR 2007884.
Miller, V. (1986). "Use of Elliptic Curves in Cryptography". Advances in Cryptology — CRYPTO '85 Proceedings. Lecture Notes in Computer Science. Vol. 85. pp. 417–426. doi:10.1007/3-540-39799-X_31. ISBN 978-3-540-16463-0. S2CID 206617984.
"Digital Signature Standard (DSS)". National Institute of Standards and Technology. 2013-07-19. doi:10.6028/NIST.FIPS.186-4.
Lay, Georg-Johann; Zimmer, Horst G. (1994). "Constructing elliptic curves with given group order over large finite fields". Algorithmic Number Theory. Lecture Notes in Computer Science. Vol. 877. pp. 250–263. doi:10.1007/3-540-58691-1_64. ISBN 978-3-540-58691-3.
Galbraith, S. D.; Smart, N. P. (1999). "A Cryptographic Application of Weil Descent". A cryptographic application of the Weil descent. Lecture Notes in Computer Science. Vol. 1746. p. 799. doi:10.1007/3-540-46665-7_23. ISBN 978-3-540-66887-9. S2CID 15134380. {{cite book}}: |work= ignored (help)
Menezes, A.; Okamoto, T.; Vanstone, S. A. (1993). "Reducing elliptic curve logarithms to logarithms in a finite field". IEEE Transactions on Information Theory. 39 (5): 1639–1646. doi:10.1109/18.259647.
Semaev, I. (1998). "Evaluation of discrete logarithm in a group of p-torsion points of an elliptic curve in characteristic p". Mathematics of Computation. 67 (221): 353–356. Bibcode:1998MaCom..67..353S. doi:10.1090/S0025-5718-98-00887-4.
Smart, N. (1999). "The discrete logarithm problem on elliptic curves of trace one". Journal of Cryptology. 12 (3): 193–196. CiteSeerX 10.1.1.17.1880. doi:10.1007/s001459900052. S2CID 24368962.
Cohen, H.; Miyaji, A.; Ono, T. (1998). "Efficient Elliptic Curve Exponentiation Using Mixed Coordinates". Advances in Cryptology — ASIACRYPT'98. Lecture Notes in Computer Science. Vol. 1514. pp. 51–65. doi:10.1007/3-540-49649-1_6. ISBN 978-3-540-65109-3.
Brown, M.; Hankerson, D.; Lopez, J.; Menezes, A. (2001). "Software Implementation of the NIST Elliptic Curves over Prime Fields". Topics in Cryptology — CT-RSA 2001. Lecture Notes in Computer Science. Vol. 2020. pp. 250–265. CiteSeerX 10.1.1.25.8619. doi:10.1007/3-540-45353-9_19. ISBN 978-3-540-41898-6.
See, for example, Biehl, Ingrid; Meyer, Bernd; Müller, Volker (2000). "Differential Fault Attacks on Elliptic Curve Cryptosystems". Advances in Cryptology — CRYPTO 2000 (PDF). Lecture Notes in Computer Science. Vol. 1880. pp. 131–146. doi:10.1007/3-540-44598-6_8. ISBN 978-3-540-67907-3.

ecc-challenge.info

"Breaking ECC2K-130". www.ecc-challenge.info.

emc.com

RSA Laboratories. "6.3.4 Are elliptic curve cryptosystems patented?". Archived from the original on 2016-11-01.

epfl.ch

lacal.epfl.ch

"112-bit prime ECDLP solved – LACAL". lacal.epfl.ch. Archived from the original on 2009-07-15. Retrieved 2009-07-11.

f5.com

Holmes, David (September 7, 2021). "RSA in a "Pre-Post-Quantum" Computing World". f5. Archived from the original on 2020-08-08. Retrieved March 16, 2021.

ghostarchive.org

Perlroth, Nicole; Larson, Jeff; Shane, Scott (2013-09-05). "N.S.A. Able to Foil Basic Safeguards of Privacy on Web". New York Times. Archived from the original on 2022-01-01. Retrieved 28 October 2018.

harvard.edu

ui.adsabs.harvard.edu

Semaev, I. (1998). "Evaluation of discrete logarithm in a group of p-torsion points of an elliptic curve in characteristic p". Mathematics of Computation. 67 (221): 353–356. Bibcode:1998MaCom..67..353S. doi:10.1090/S0025-5718-98-00887-4.

hp.com

hpl.hp.com

Gaudry, P.; Hess, F.; Smart, N. P. (2000). "Constructive and destructive facets of Weil descent on elliptic curves" (PDF). Hewlett Packard Laboratories Technical Report. Archived from the original (PDF) on 2006-12-06. Retrieved 2006-01-02.
Smart, N. (1999). "The discrete logarithm problem on elliptic curves of trace one". Journal of Cryptology. 12 (3): 193–196. CiteSeerX 10.1.1.17.1880. doi:10.1007/s001459900052. S2CID 24368962.

iacr.org

eprint.iacr.org

Hitt, L. (2006). "On an Improved Definition of Embedding Degree". IACR ePrint Report. 415.
Hedabou, M.; Pinel, P.; Beneteau, L. (2004). "A comb method to render ECC resistant against Side Channel Attacks" (PDF). {{cite journal}}: Cite journal requires |journal= (help)
Banegas, G.; Bernstein, D. J.; Hoof, I. van; Lange, T. (2020). "Concrete quantum cryptanalysis of binary elliptic curves" (PDF). {{cite journal}}: Cite journal requires |journal= (help)
De Feo, Luca; Jao, Plut (2011). "Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies". Cryptology ePrint Archive, Report 2011/506. IACR. Archived from the original on 2014-05-03. Retrieved 3 May 2014.
Robert, Damien (2022). "Breaking SIDH in polynomial time". Cryptology ePrint Archive.

iacr.org

See, for example, Biehl, Ingrid; Meyer, Bernd; Müller, Volker (2000). "Differential Fault Attacks on Elliptic Curve Cryptosystems". Advances in Cryptology — CRYPTO 2000 (PDF). Lecture Notes in Computer Science. Vol. 1880. pp. 131–146. doi:10.1007/3-540-44598-6_8. ISBN 978-3-540-67907-3.

ieee.org

grouper.ieee.org

IEEE P1363 Archived 2007-02-13 at the Wayback Machine, section A.12.1

jstor.org

Koblitz, N. (1987). "Elliptic curve cryptosystems". Mathematics of Computation. 48 (177): 203–209. doi:10.2307/2007884. JSTOR 2007884.

nist.gov

csrc.nist.gov

"Digital Signature Standard (DSS)". National Institute of Standards and Technology. 2013-07-19. doi:10.6028/NIST.FIPS.186-4.
FIPS PUB 186-3, Digital Signature Standard (DSS).
"Search – CSRC". csrc.nist.gov.
NIST, Recommendation for Key Management—Part 1: general, Special Publication 800-57, August 2005.

nsa.gov

"The Case for Elliptic Curve Cryptography". NSA. Archived from the original on 2009-01-17.
"Fact Sheet NSA Suite B Cryptography". U.S. National Security Agency. Archived from the original on 2009-02-07.

apps.nsa.gov

"Commercial National Security Algorithm Suite". www.nsa.gov. 19 August 2015. Archived from the original on 2019-06-04. Retrieved 2020-01-08.

nytimes.com

Perlroth, Nicole; Larson, Jeff; Shane, Scott (2013-09-05). "N.S.A. Able to Foil Basic Safeguards of Privacy on Web". New York Times. Archived from the original on 2022-01-01. Retrieved 28 October 2018.

bits.blogs.nytimes.com

"Government Announces Steps to Restore Confidence on Encryption Standards". NY Times – Bits Blog. 2013-09-10. Retrieved 2015-11-06.

psu.edu

citeseerx.ist.psu.edu

Smart, N. (1999). "The discrete logarithm problem on elliptic curves of trace one". Journal of Cryptology. 12 (3): 193–196. CiteSeerX 10.1.1.17.1880. doi:10.1007/s001459900052. S2CID 24368962.
Brown, M.; Hankerson, D.; Lopez, J.; Menezes, A. (2001). "Software Implementation of the NIST Elliptic Curves over Prime Fields". Topics in Cryptology — CT-RSA 2001. Lecture Notes in Computer Science. Vol. 2020. pp. 250–265. CiteSeerX 10.1.1.25.8619. doi:10.1007/3-540-45353-9_19. ISBN 978-3-540-41898-6.

schneier.com

"Did NSA Put a Secret Backdoor in New Encryption Standard?". www.schneier.com.

secg.org

"GEC 2: Test Vectors for SEC 1" (PDF). www.secg.org. Archived from the original (PDF download) on 2013-06-06.

seclists.org

Cohen, Cfir (25 June 2019). "AMD-SEV: Platform DH key recovery via invalid curve attack (CVE-2019-9836)". Seclist Org. Archived from the original on 2 July 2019. Retrieved 4 July 2019. The SEV elliptic-curve (ECC) implementation was found to be vulnerable to an invalid curve attack. At launch-start command, an attacker can send small order ECC points not on the official NIST curves, and force the SEV firmware to multiply a small order point by the firmware's private DH scalar.

semanticscholar.org

api.semanticscholar.org

Miller, V. (1986). "Use of Elliptic Curves in Cryptography". Advances in Cryptology — CRYPTO '85 Proceedings. Lecture Notes in Computer Science. Vol. 85. pp. 417–426. doi:10.1007/3-540-39799-X_31. ISBN 978-3-540-16463-0. S2CID 206617984.
Galbraith, S. D.; Smart, N. P. (1999). "A Cryptographic Application of Weil Descent". A cryptographic application of the Weil descent. Lecture Notes in Computer Science. Vol. 1746. p. 799. doi:10.1007/3-540-46665-7_23. ISBN 978-3-540-66887-9. S2CID 15134380. {{cite book}}: |work= ignored (help)
Smart, N. (1999). "The discrete logarithm problem on elliptic curves of trace one". Journal of Cryptology. 12 (3): 193–196. CiteSeerX 10.1.1.17.1880. doi:10.1007/s001459900052. S2CID 24368962.

slashdot.org

it.slashdot.org

Bruce Schneier (5 September) "I no longer trust the constants. I believe the NSA has manipulated them through their relationships with industry." See Are the NIST Standard Elliptic Curves Back-doored?, Slashdot, 11 September 2013.

web.archive.org

"The Case for Elliptic Curve Cryptography". NSA. Archived from the original on 2009-01-17.
"Fact Sheet NSA Suite B Cryptography". U.S. National Security Agency. Archived from the original on 2009-02-07.
"Commercial National Security Algorithm Suite". www.nsa.gov. 19 August 2015. Archived from the original on 2019-06-04. Retrieved 2020-01-08.
RSA Laboratories. "6.3.4 Are elliptic curve cryptosystems patented?". Archived from the original on 2016-11-01.
"GEC 2: Test Vectors for SEC 1" (PDF). www.secg.org. Archived from the original (PDF download) on 2013-06-06.
Gaudry, P.; Hess, F.; Smart, N. P. (2000). "Constructive and destructive facets of Weil descent on elliptic curves" (PDF). Hewlett Packard Laboratories Technical Report. Archived from the original (PDF) on 2006-12-06. Retrieved 2006-01-02.
IEEE P1363 Archived 2007-02-13 at the Wayback Machine, section A.12.1
"112-bit prime ECDLP solved – LACAL". lacal.epfl.ch. Archived from the original on 2009-07-15. Retrieved 2009-07-11.
"Certicom Announces Elliptic Curve Cryptography Challenge Winner". Certicom. April 27, 2004. Archived from the original on 2011-07-19.
Hitchcock, Y.; Dawson, E.; Clark, A.; Montague, P. (2002). "Implementing an efficient elliptic curve cryptosystem over GF(p) on a smart card" (PDF). ANZIAM Journal. 44. Archived from the original (PDF) on 2006-03-27.
Holmes, David (September 7, 2021). "RSA in a "Pre-Post-Quantum" Computing World". f5. Archived from the original on 2020-08-08. Retrieved March 16, 2021.
De Feo, Luca; Jao, Plut (2011). "Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies". Cryptology ePrint Archive, Report 2011/506. IACR. Archived from the original on 2014-05-03. Retrieved 3 May 2014.
Cohen, Cfir (25 June 2019). "AMD-SEV: Platform DH key recovery via invalid curve attack (CVE-2019-9836)". Seclist Org. Archived from the original on 2 July 2019. Retrieved 4 July 2019. The SEV elliptic-curve (ECC) implementation was found to be vulnerable to an invalid curve attack. At launch-start command, an attacker can send small order ECC points not on the official NIST curves, and force the SEV firmware to multiply a small order point by the firmware's private DH scalar.

wired.com

Kim Zetter, RSA Tells Its Developer Customers: Stop Using NSA-Linked Algorithm Wired, 19 September 2013. "Recommending against the use of SP 800-90A Dual Elliptic Curve Deterministic Random Bit Generation: NIST strongly recommends that, pending the resolution of the security concerns and the re-issuance of SP 800-90A, the Dual_EC_DRBG, as specified in the January 2012 version of SP 800-90A, no longer be used."

yp.to

cr.yp.to

Bernstein, D. J. "Irrelevant patents on elliptic-curve cryptography".
Brown, M.; Hankerson, D.; Lopez, J.; Menezes, A. (2001). "Software Implementation of the NIST Elliptic Curves over Prime Fields". Topics in Cryptology — CT-RSA 2001. Lecture Notes in Computer Science. Vol. 2020. pp. 250–265. CiteSeerX 10.1.1.25.8619. doi:10.1007/3-540-45353-9_19. ISBN 978-3-540-41898-6.

Elliptic-curve cryptography (English Wikipedia)

arxiv.org

austms.org.au

anziamj.austms.org.au

certicom.com

cryptome.org

doi.org

ecc-challenge.info

emc.com

epfl.ch

lacal.epfl.ch

f5.com

ghostarchive.org

harvard.edu

ui.adsabs.harvard.edu

hp.com

hpl.hp.com

iacr.org

eprint.iacr.org

iacr.org

ieee.org

grouper.ieee.org

jstor.org

nist.gov

csrc.nist.gov

nsa.gov

nsa.gov

apps.nsa.gov

nytimes.com

nytimes.com

bits.blogs.nytimes.com

psu.edu

citeseerx.ist.psu.edu

schneier.com

secg.org

seclists.org

semanticscholar.org

api.semanticscholar.org

slashdot.org

it.slashdot.org

web.archive.org

wired.com

yp.to

cr.yp.to

safecurves.cr.yp.to

blog.cr.yp.to

rump2007.cr.yp.to