Talk:Elliptic-curve cryptography: Difference between revisions

Revision as of 15:03, 28 June 2017

Latest revision as of 23:20, 30 August 2024

(20 intermediate revisions by 17 users not shown)

Line 1:

{{WikiProject Cryptographybanner shell|class=C|importance1=High}}

{{WikiProject NumismaticsCryptography |class=C|importance=low |cryptocurrency=Yes |cryptocurrency-importance=midHigh}}

{{WikiProject Numismatics |importance=low }}

{{maths rating|class=Start|priority=Mid|field=discrete}}

{{WikiProject Cryptocurrency|importance=mid}}

{{todo|4}}

{{WikiProject Mathematics|priority=Mid }}

}}

{{annual readership|scale=log}}

==Security analysis of ECC==

Interesting research and summary of security for different ECC: https://safecurves.cr.yp.to/ <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/153.46.253.213|153.46.253.213]] ([[User talk:153.46.253.213#top|talk]]) 14:18, 4 August 2023 (UTC)</small> <!--Autosigned by SineBot-->

==Cite required==

Line 21 ⟶ 27:

See www.nist.gov/encryption for a list of recommended elliptic curves. ANSI X9 requires a minimum of 80 bits of *symmetric key equivalent* security. THis means use of SHA-1 with 160 bit output, use of RSA/DSA with 1024 bit keys and use of ECC with 160 bit keys. Don Johnson

The references of 256 bit ECC keys providing 128-bit security need citation.

[[User:Bdamm|Bdamm]] ([[User talk:Bdamm|talk]]) 17:23, 13 August 2018 (UTC)

== Non-mathematical description needed ==

Line 157 ⟶ 166:

:Good catch! I updated the reference. If you need more information or have any other ideas, please share. [[User:Skippydo|Skippydo]] ([[User talk:Skippydo|talk]]) 01:58, 26 June 2012 (UTC)

::I found a copy of the first 1997 Eicher reference if it is still of use: (cite tag: {{cite journal |title=Using the Quantum Computer to Break Elliptic Curve Cryptosystems |first=Jodie |last=Eicher |first2=Yaw |last2=Opoku |date=July 29, 1997 |url=http://www.mathcs.richmond.edu/~jad/summerwork/ellipticcurvequantum.pdf |archiveurl=http://web.archive.org/web/20030509012110/http://www.mathcs.richmond.edu/~jad/summerwork/ellipticcurvequantum.pdf |archivedate=2003-05-09 |dead-url=no}}). I (probably is) be outdated though, though it might be useful for background info (?). [[User:Jimw338|Jimw338]] ([[User talk:Jimw338|talk]]) 04:18, 12 September 2016 (UTC)

I just rewrote the whole section with an updated citation and what I hope is both clearer wording and a more NPOV. [[User:Tarcieri|Tarcieri]] ([[User talk:Tarcieri|talk]]) 18:40, 3 November 2017 (UTC)

{{reflist-talk}}

== Possible NSA backdoor ==

Line 224 ⟶ 237:

Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 02:32, 23 December 2016 (UTC)

== External links modified ==

Hello fellow Wikipedians,

I have just modified 2 external links on [[Elliptic-curve cryptography]]. Please take a moment to review [https://en.wikipedia.org/w/index.php?diff=prev&oldid=801469098 my edit]. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit [[User:Cyberpower678/FaQs#InternetArchiveBot|this simple FaQ]] for additional information. I made the following changes:

*Added archive https://web.archive.org/web/20140503190338/http://eprint.iacr.org/2011/506 to https://eprint.iacr.org/2011/506

*Added archive https://archive.is/20121208212741/http://wiki.crypto.rub.de/Buch/movies.php to http://wiki.crypto.rub.de/Buch/movies.php

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

{{sourcecheck|checked=false|needhelp=}}

Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 21:14, 19 September 2017 (UTC)

==Algorithm needed==

This article doesn't contain the algorithm for ECC like the RSA article does. <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/198.52.160.180|198.52.160.180]] ([[User talk:198.52.160.180#top|talk]]) 20:30, 6 December 2019 (UTC)</small> <!--Autosigned by SineBot-->

== The first paragraph seems self-contradictory ==

The first paragraph states that ECC is based on finite fields, as opposed to non-EC cryptography, which is based on plain Galois fields. However, the referenced article on [[Finite field|finite fields]] explains that finite fields and Galois fields are one and the same. I suspect the intended meaning is that non-EC crypto is based structures over finite fields which are not elliptic curves. If so, this is not clear from the text. I won't change the formulation myself, since I'm not an expert in the field. <!-- Template:Unsigned --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:VecLuci|VecLuci]] ([[User talk:VecLuci#top|talk]] • [[Special:Contributions/VecLuci|contribs]]) 04:13, 10 October 2018 (UTC)</small> <!--Autosigned by SineBot-->

== Not a typo. 521, not 512. ==

"Five prime fields <math>\mathbb{F}_p</math> for certain primes ''p'' of sizes 192, 224, 256, 384, and <nowiki>{{Not a typo|521}}</nowiki> bits. For each of the prime fields, one elliptic curve is recommended."

Should there be a footnote about that 521 not being a typo? It really is 521 (see [https://crypto.stackexchange.com/questions/62083/why-would-diffie-hellman-group-21-be-521-bits-rather-than-512] among many, many sources) but it really looks like someone mis-typed "512". [[Special:Contributions/76.216.220.191|76.216.220.191]] ([[User talk:76.216.220.191|talk]]) 04:00, 28 December 2021 (UTC)