Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices

DOI10.1016/J.INS.2020.05.075MaRDI QIDQ2666752zbMATH OpenOpenAlexFDO

Authors Majid Mumtaz, Luo Ping

Publication date 23 November 2021

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2020.05.075

zbMATH Keywords

common-prime RSACoppersmith's methodcryptanalysisexperimental studylattice-basis reduction

Mathematics Subject Classification ID

Internet topics (68M11) Cryptography (94A60)

Recommendations

• Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
• Improved results on cryptanalysis of prime power RSA
• Cryptanalysis of RSA for a special case with \(d > e\)
• Cryptanalysis of RSA with small prime combination
• Cryptanalysis of the RSA variant based on cubic Pell equation

Cites work

• A deterministic algorithm for computing divisors in an interval
• A method for obtaining digital signatures and public-key cryptosystems
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Advances in Cryptology - EUROCRYPT 2004
• Batch RSA
• Carmichael's lambda function
• Cryptanalysis of RSA and its variants.
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of short RSA secret exponents
• Cryptanalysis of the randomized version of a lattice-based signature scheme from PKC'08
• Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
• Factoring polynomials with rational coefficients
• Finding a small root of a univariate modular equation
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• Floating-Point LLL: Theoretical and Practical Aspects
• scientific article; zbMATH DE number 1302856 (Why is no real title available?)
• scientific article; zbMATH DE number 1182510 (Why is no real title available?)
• scientific article; zbMATH DE number 1942424 (Why is no real title available?)
• Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
• Solving linear equations modulo unknown divisors: revisited
• Topics in Cryptology – CT-RSA 2006
• Using LLL-reduction for solving RSA and factorization problems

Cited in

(4)

• Comment on ``Practical and secure outsourcing algorithms for solving quadratic congruences in Internet of Things
• Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)
• Execution of cryptographic operations according to RSA scheme in resource-constrained environments
• A novel partial key exposure attack on common prime RSA

This page was built for publication: Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices

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