Difference between revisions of "Discrete logarithm problem"
Todd Price (talk | contribs) (Created page with "The discrete logarithm problem is considered to be computationally intractable. That is, no efficient classical algorithm is known for computing discrete logarithms in general...") |
Todd Price (talk | contribs) |
||
| Line 1: | Line 1: | ||
| − | The discrete logarithm problem is considered to be computationally intractable. That is, no efficient classical algorithm is known for computing discrete logarithms in general. | + | The discrete logarithm problem is considered to be computationally [[intractable]]. That is, no efficient classical algorithm is known for computing discrete logarithms in general. |
Several important algorithms in public-key [[cryptography]] base their security on the assumption that the discrete logarithm problem over carefully chosen groups has no efficient solution. | Several important algorithms in public-key [[cryptography]] base their security on the assumption that the discrete logarithm problem over carefully chosen groups has no efficient solution. | ||
Latest revision as of 03:52, 22 April 2022
The discrete logarithm problem is considered to be computationally intractable. That is, no efficient classical algorithm is known for computing discrete logarithms in general.
Several important algorithms in public-key cryptography base their security on the assumption that the discrete logarithm problem over carefully chosen groups has no efficient solution.