Is there a method to break an ECC curve for all key-pairs (Q,d) such that (Q=d*G) faster than breaking every single key-pair? Is there any memory trade-off that helps such attack?
If so, then, as Bitcoin grows, the monetary incentive for an attack to the curve will increase over time. An attacker that could break the whole curve at once could steal all the money.
If not, then there is nothing to worry about since the use of unique addresses and the slicing of payments of high value into low value payments can reduce the incentive to a minimum.
Obviously this is not a problem we should worry in the nearby future, but maybe we should in 30 years.
Best regards,
Sergio.
Topic: Crypto question: Breaking ECDSA for all key-pairs simultaneously? - page 2. (Read 4490 times)
September 11, 2012, 10:48:48 PM
Jump to: