Content deleted Content added
→Quantum Computing Attack Citations: new section |
|||
Line 153:
In reference to quantum computing attacks the article reads "Elliptic curve cryptography is vulnerable to a modified Shor's algorithm for solving the discrete logarithm problem on elliptic curves" with two citations (<ref>{{cite journal |title=Using the Quantum Computer to Break Elliptic Curve Cryptosystems |first=Jodie |last=Eicher |first2=Yaw |last2=Opoku |date=July 29, 1997 }}</ref><ref>{{cite journal |title=Shor's Discrete Logarithm Quantum Algorithm for Elliptic Curves |first=John |last=Proos |first2=Christof |last2=Zalka |year=2003 |journal=Quantum Information and Computing |volume=3 |issue=4 |pages=317–344 |doi= |arxiv=quant-ph/0301141 |bibcode=2003quant.ph..1141P }}</ref>). Looking through both of these citations, they both work over fields of prime order, with the latter paper explicitly stating that they did not consider fields of prime power order. If ECC over fields of prime power order is truly vulnerable to QC attacks, I think there should be a citation that references this. [[User:GromXXVII|GromXXVII]] ([[User talk:GromXXVII|talk]]) 22:20, 25 June 2012 (UTC)
: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)
| |||