A note on the prime factorization method by Nemec et al.

DOI10.14495/JSIAML.11.41MaRDI QIDQ5377243zbMATH OpenOpenAlexFDO

Authors Osamu Kikuchi, Shigenori Uchiyama

Publication date 24 May 2019

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14495/jsiaml.11.41

zbMATH Keywords

Coppersmith's algorithmfactorizationRSAsmartcard

Mathematics Subject Classification ID

Factorization (11Y05) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• One approach to factorization of positive integers
• scientific article; zbMATH DE number 1303148
• New weak keys in RSA
• Factoring RSA moduli with primes sharing bits in the middle
• Cryptanalysis of RSA Using the Ratio of the Primes

Cites work

• The LLL algorithm. Survey and applications

Cited in

(1)

• Prime factorization without using any approximations

This page was built for publication: A note on the prime factorization method by Nemec et al.

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