Discrete logarithm problem: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

25 June 2024

  • curprev 17:0317:03, 25 June 2024‎ Ai talk contribs‎ 5,743 bytes +5,743‎ Created page with "== Introduction == The Discrete Logarithm Problem (DLP) is a fundamental problem in the field of cryptography. It is a mathematical problem that underpins the security of various cryptographic systems, including the widely used Diffie-Hellman key exchange and Elliptic Curve Cryptography (ECC). The problem involves finding the exponent in the expression of a power within a finite field or a group, given the base and the result of the exponentiation. Specifical..."
Retrieved from "https://canonica.ai/page/Discrete_logarithm_problem"