How to Factor N 1 and N 2 When $p_1=p_2 \bmod 2^t$

DOI10.1007/978-3-642-41383-4_14zbMath1344.11079OpenAlexW200511318MaRDI QIDQ3190027

Takuma Ueda, Kaoru Kurosawa

Publication date: 15 September 2014

Published in: Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41383-4_14

zbMATH Keywords

latticefactoringGaussian reduction algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (3)

A generalization of the big Picard theorem ⋮ A Simple and Improved Algorithm for Integer Factorization with Implicit Hints ⋮ Implicit factorization of unbalanced RSA moduli

This page was built for publication: How to Factor N 1 and N 2 When $p_1=p_2 \bmod 2^t$