When e-th Roots Become Easier Than Factoring

DOI10.1007/978-3-540-76900-2_2zbMath1153.11345OpenAlexW1879384276MaRDI QIDQ5387090

David Naccache, Antoine Joux, Emmanuel Thomé

Publication date: 15 May 2008

Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_2

zbMATH Keywords

RSArootsfactoringNFS

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (max. 100)

Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Another look at non-standard discrete log and Diffie-Hellman problems ⋮ Efficient verifiable delay functions ⋮ Breaking RSA Generically Is Equivalent to Factoring ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

Cites Work

• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Solving sparse rational linear systems
• A method for obtaining digital signatures and public-key cryptosystems
• Discrete logarithms and local units
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Public Key Cryptography - PKC 2006
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: When e-th Roots Become Easier Than Factoring