Cryptanalysis of the multi-power RSA cryptosystem variant

DOI10.1007/978-3-031-20974-1_12zbMath1528.94029MaRDI QIDQ6164403

Abderrahmane Nitaj, Didier Alquié, Guy Chassé

Publication date: 28 July 2023

Published in: Cryptology and Network Security (Search for Journal in Brave)

zbMATH Keywords

RSAfactorizationCoppersmith's methodmulti-power RSAlattice reduction

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Improved cryptanalysis of the multi-power RSA cryptosystem variant

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Improved factorization of \(N=p^rq^s\)
• Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
• A New Rabin-type Trapdoor Permutation Equivalent to Factoring
• Solving Linear Equations Modulo Unknown Divisors: Revisited
• Cryptanalysis of short RSA secret exponents
• Cryptanalysis of RSA and Its Variants
• A method for obtaining digital signatures and public-key cryptosystems
• Public Key Cryptography – PKC 2004
• A generalized attack on the multi-prime power RSA

This page was built for publication: Cryptanalysis of the multi-power RSA cryptosystem variant