Solving linear equations modulo unknown divisors: revisited

DOI10.1007/978-3-662-48797-6_9zbMATH Open1344.94062OpenAlexW2296540018MaRDI QIDQ2811131FDOQ2811131

Dongdai Lin, Yao Lu, Liqiang Peng, Rui Zhang

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

Recommendations

• Better lattice constructions for solving multivariate linear equations modulo unknown divisors
• Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
• Solving Simultaneous Modular Equations of Low Degree
• scientific article; zbMATH DE number 1303120
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem

zbMATH Keywords

RSAlattice-based analysislinear modular equations

Mathematics Subject Classification ID

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

Cited In (25)

• Finding small roots for bivariate polynomials over the ring of integers
• Cryptanalysis of the RSA variant based on cubic Pell equation
• Forty years of attacks on the RSA cryptosystem: A brief survey
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• Generalized cryptanalysis of small CRT-exponent RSA
• Revisiting prime power RSA
• Improved Herrmann-May's attack with merging variables and lower LLL bound
• Partial key exposure attack on common prime RSA
• Towards Optimal Bounds for Implicit Factorization Problem
• Small CRT-exponent RSA revisited
• A new generalization of the KMOV cryptosystem
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• An Improved Analysis on Three Variants of the RSA Cryptosystem
• Improved cryptanalysis of the multi-power RSA cryptosystem variant
• Improved Results on Cryptanalysis of Prime Power RSA
• Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
• Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
• Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
• New Results of Breaking the CLS Scheme from ACM-CCS 2014
• Smooth subsum search a heuristic for practical integer factorization
• Small CRT-Exponent RSA Revisited
• A generalized attack on the multi-prime power RSA
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
• Cryptanalysis of the multi-power RSA cryptosystem variant

This page was built for publication: Solving linear equations modulo unknown divisors: revisited

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