Discovery of Elliptic Curve Cryptographic Private Key in O(n)
Cryptography and Security
2009-12-24 v1
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).
Keywords
Cite
@article{arxiv.0912.4694,
title = {Discovery of Elliptic Curve Cryptographic Private Key in O(n)},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:0912.4694},
year = {2009}
}
Comments
2 pages, 0 figures