The discrete logarithm modulo a composite hides 0(n) Bits
- 31 December 1993
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 47 (3) , 376-404
- https://doi.org/10.1016/0022-0000(93)90038-x
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Efficient Factoring Based on Partial InformationPublished by Springer Nature ,2007
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Nature ,2000
- An interactive identification scheme based on discrete logarithms and factoringJournal of Cryptology, 1992
- Pseudo-random generators under uniform assumptionsPublished by Association for Computing Machinery (ACM) ,1990
- The Discrete Logarithm Hides $O(\log n)$ BitsSIAM Journal on Computing, 1988
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- The Differences between Consecutive PrimesJournal of the London Mathematical Society, 1978
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978