A Simple and Improved Algorithm for Integer Factorization with Implicit Hints

DOI10.1007/978-3-319-16715-2_14zbMath1382.11095OpenAlexW240421938MaRDI QIDQ2790046

Koji Nuida, Kaoru Kurosawa, Naoto Itakura

Publication date: 2 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_14

zbMATH Keywords

Gaussian reductioninteger factorization with implicit hint

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cites Work

• The development of the number field sieve
• Factoring integers with elliptic curves
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• How to Factor N 1 and N 2 When $p_1=p_2 \bmod 2^t$
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• A method for obtaining digital signatures and public-key cryptosystems
• Batch Fully Homomorphic Encryption over the Integers
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization