Date: 2018-10-05 10:39:17Abstract algebra Algebra Cryptography Group theory Finite fields Logarithms Elliptic curve cryptography Public-key cryptography Index calculus algorithm Elliptic-curve cryptography Discrete logarithm Random walk | | The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1 University of PennsylvaniaAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source Website File Size: 265,05 KBShare Document on Facebook
|