Article
Version 1
This version is not peer-reviewed
Discrete Logarithms
Version 1
: Received: 12 September 2024 / Approved: 14 September 2024 / Online: 16 September 2024 (11:46:14 CEST)
How to cite: Matysiak, L. Discrete Logarithms. Preprints 2024, 2024091141. https://doi.org/10.20944/preprints202409.1141.v1 Matysiak, L. Discrete Logarithms. Preprints 2024, 2024091141. https://doi.org/10.20944/preprints202409.1141.v1
Abstract
In this paper we present two algorithms for computing discrete logarithms. We present some properties and show how we break the Diffie-Hellman protocol, which is considered to be very secure.
Keywords
algorithm; congruence; discrete logarithm; protocol
Subject
Computer Science and Mathematics, Security Systems
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment