Discrete Logarithm Problem in $\mathbb{F}_{p}$ and using Elliptic curves

Asked Jun 26 '13 at 10:14

Active Jun 26 '13 at 10:14

Viewed 51 times

I want to learn about the hardness of the DLP in $\mathbb{F}_{p}$ and using Elliptic curves, and the best attacks against each. I want to be able to compare the hardness of the problem in the two setups. \ Can someone suggest me some useful links, books or papers?

asked Jun 26 '13 at 10:14

Shiva

A Course in Number Theory and Cryptography by Neal Koblitz might be a good place to start. – Gerry Myerson Jun 26 '13 at 12:30

Discrete Logarithm Problem in $\mathbb{F}_{p}$ and using Elliptic curves

0 Answers0