TL;DR
This paper introduces a probabilistic algorithm for computing discrete logarithms in large finite groups, which are fundamental to many cryptographic systems.
Contribution
It presents a novel probabilistic approach to solving discrete logarithms, enhancing understanding of their computational complexity.
Findings
The algorithm demonstrates improved efficiency over previous methods.
It provides insights into the security assumptions of cryptographic protocols.
Potential applications in cryptanalysis and cryptographic security analysis.
Abstract
The discrete logarithm in a finite group of large order has been widely applied in public key cryptosystem. In this paper, we will present a probabilistic algorithm for discrete logarithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Data Security · Chaos-based Image/Signal Encryption