Solving linear equations modulo unknown divisors: revisited

DOI10.1007/978-3-662-48797-6_9MaRDI QIDQ2811131zbMATH OpenOpenAlexFDO

Authors Yao Lu, Rui Zhang, Liqiang Peng, Dongdai 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)

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

Cited in

(30)

• Cryptanalysis of the multi-power RSA cryptosystem variant
• Cryptanalysis of the RSA variant based on cubic Pell equation
• Finding small roots for bivariate polynomials over the ring of integers
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• Revisiting prime power RSA
• Generalized cryptanalysis of small CRT-exponent RSA
• On optimal bounds of small inverse problems and approximate GCD problems with higher degree
• An improved analysis on three variants of the RSA cryptosystem
• Better lattice constructions for solving multivariate linear equations modulo unknown divisors
• Improved Herrmann-May's attack with merging variables and lower LLL bound
• Partial key exposure attack on common prime RSA
• Small CRT-exponent RSA revisited
• Improved results on cryptanalysis of prime power RSA
• 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
• Forty years of attacks on the RSA cryptosystem: a brief survey
• Improved cryptanalysis of the multi-power RSA cryptosystem variant
• 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
• Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
• New Results of Breaking the CLS Scheme from ACM-CCS 2014
• An exhaustive search method to find all small solutions of a multivariate modular linear equation
• Smooth subsum search a heuristic for practical integer factorization
• Small CRT-Exponent RSA Revisited
• Finding a small root of a univariate modular equation
• 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
• Towards optimal bounds for implicit factorization problem

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)