On reducing factorization to the discrete logarithm problem modulo a composite

DOI10.1007/S00037-012-0037-5zbMATH Open1270.11127OpenAlexW2162104065MaRDI QIDQ445245FDOQ445245

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

Recommendations

• Reductions among number theoretic problems
• Small Generating Sets and DLPC Problem
• Discrete logarithms, Diffie-Hellman, and reductions
• scientific article; zbMATH DE number 549859
• Polylog depth circuits for integer factoring and discrete logarithms

zbMATH Keywords

deterministic subexponential time reductiondiscrete logarithm problem modulo a compositeInteger factorization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• A key distribution system equivalent to factoring
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• The development of the number field sieve
• A deterministic version of Pollard's \(p-1\) algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Integer factoring and compositeness witnesses
• Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus

This page was built for publication: On reducing factorization to the discrete logarithm problem modulo a composite

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445245)