The Discrete Logarithm Hides $O(\log n)$ Bits
- 1 April 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (2), 363-372
- https://doi.org/10.1137/0217021
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Simultaneous Security of Bits in the Discrete LogPublished by Springer Nature ,2007
- Protocols for secure computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- How to generate cryptographically strong sequences of pseudo random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970