I was wondering why some groups provide more security to cryptosystems relying on DL-Problem.
3
-
1$\begingroup$ Welcome to crypto.SE. Hint for your research towards this apparent assignment: find what the DLP is in the group $(\mathbb Z_n,+)$, and solve it using e.g. the extended Euclidean algorithm or the slightly simplified variant there. Then consider the group $(\Bbb Z_p^*,*)$ and the impact of index calculus and GNFS for the DLP. $\endgroup$– fgrieu ♦Commented May 28, 2020 at 10:56
-
$\begingroup$ You may want to have a look at safecurves.cr.yp.to. They introduce some notions about the security of elliptic curves. $\endgroup$– BinouCommented May 28, 2020 at 13:18
-
3$\begingroup$ This might be helpful, too. Discrete Logarithm: Given a p, what does it mean to find the discrete logarithm of x to base y? $\endgroup$– kelalakaCommented May 28, 2020 at 15:52
Add a comment
|