Discovery of Elliptic Curve Cryptographic Private Key in O(n)
Abstract
An algorithm is presented that in context of public key use of Elliptic Curve Cryptography allows discovery of the private key in worst case O(n).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.