Which groups are secure for DL-Problem?

Asked May 28 '20 at 10:36

Active Jul 17 '20 at 09:27

Viewed 61 times

I was wondering why some groups provide more security to cryptosystems relying on DL-Problem.

edited Jul 17 '20 at 09:27

asked May 28 '20 at 10:36

WonderHow20

1

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. – fgrieu May 28 '20 at 10:56
You may want to have a look at https://safecurves.cr.yp.to/. They introduce some notions about the security of elliptic curves. – Binou May 28 '20 at 13:18
3

This might be helpful, too. Discrete Logarithm: Given a p, what does it mean to find the discrete logarithm of x to base y? – kelalaka May 28 '20 at 15:52

0 Answers0