A subexponential algorithm for the discrete logarithm problem with applications to cryptography
- 1 October 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 55-60
- https://doi.org/10.1109/sfcs.1979.2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Reducibility, randomness, and intractibility (Abstract)Published by Association for Computing Machinery (ACM) ,1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- Computational complexity of probabilistic Turing machinesPublished by Association for Computing Machinery (ACM) ,1974
- On the number of positive integers ≤ x and free of prime factors > y, IIIndagationes Mathematicae, 1966
- On The Number of Positive Integers ≤ x and Free of Prime Factors > yIndagationes Mathematicae, 1951
- The Difference between Consecutive Prime NumbersJournal of the London Mathematical Society, 1938