Intractable problems in number theory (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
The discrete log is very discreet
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A Non-interactive Public-Key Distribution System
Designs, Codes and Cryptography
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Adaptively secure distributed public-key systems
Theoretical Computer Science
Secure Key-Evolving Protocols for Discrete Logarithm Schemes
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Adaptively-Secure Distributed Public-Key Systems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Extended Proxy Signatures for Smart Cards
ISW '99 Proceedings of the Second International Workshop on Information Security
Adaptive Security for the Additive-Sharing Based Proactive RSA
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A note on Girault's self-certified model
Information Processing Letters
Provably secure fail-stop signature schemes based on RSA
International Journal of Wireless and Mobile Computing
On Black-Box Ring Extraction and Integer Factorization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Interpolation of functions related to the integer factoring problem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
PRIME: private RSA infrastructure for memory-less encryption
Proceedings of the 29th Annual Computer Security Applications Conference
| Hi-index | 0.00 |
This note discusses the relationship between the two problems of the title. We present probabilistic polynomial-time reduction that show: 1) To factor n, it suffices to be able to compute discrete logarithms modulo n. 2) To compute a discrete logarithm modulo a prime power p^E, it suffices to know It mod p. 3) To compute a discrete logarithm modulo any n, it suffices to be able to factor and compute discrete logarithms modulo primes. To summarize: solving the discrete logarithm problem for a composite modulus is exactly as hard as factoring and solving it modulo primes.