On reducing factorization to the discrete logarithm problem modulo a composite
From MaRDI portal
Publication:445245
DOI10.1007/s00037-012-0037-5zbMath1270.11127OpenAlexW2162104065MaRDI QIDQ445245
Bartosz Źrałek, Jacek Pomykała
Publication date: 24 August 2012
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-012-0037-5
deterministic subexponential time reductiondiscrete logarithm problem modulo a compositeInteger factorization
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)
Related Items (1)
Cites Work
- The development of the number field sieve
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- A key distribution system equivalent to factoring
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- A deterministic version of Pollard’s $p-1$ algorithm
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Unnamed Item
- Unnamed Item
This page was built for publication: On reducing factorization to the discrete logarithm problem modulo a composite