A Cryptographic Attack: Finding the Discrete Logarithm on Elliptic Curves of Trace One
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric problem. The elliptic curve discrete logarithm problem, as it is called, is hoped to be generally hard in one direction but not the other, and it is this asymmetry that makes it secure. This paper descri...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2015
|
| Subjects: | |
| Online Access: | http://scholarship.claremont.edu/scripps_theses/716 http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1633&context=scripps_theses |