Solving Linear Equations Modulo Unknown Divisors: Revisited

DOI10.1007/978-3-662-48797-6_9zbMath1344.94062OpenAlexW2296540018MaRDI QIDQ2811131

Yao Lu, Liqiang Peng, Rui Zhang, Dong-Dai Lin

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_9

zbMATH Keywords

RSAlattice-based analysislinear modular equations

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (18)

Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ A generalized attack on the multi-prime power RSA ⋮ Cryptanalysis of the multi-power RSA cryptosystem variant ⋮ Improved cryptanalysis of the multi-power RSA cryptosystem variant ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ An Improved Analysis on Three Variants of the RSA Cryptosystem ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ A new generalization of the KMOV cryptosystem ⋮ Towards Optimal Bounds for Implicit Factorization Problem ⋮ Generalized cryptanalysis of small CRT-exponent RSA ⋮ Revisiting prime power RSA ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

This page was built for publication: Solving Linear Equations Modulo Unknown Divisors: Revisited