Cryptanalysis of RSA variants with primes sharing most significant bits

DOI10.1007/978-3-030-91356-4_3zbMath1504.94122OpenAlexW3214944040MaRDI QIDQ2154038

Meryem Cherkaoui-Semmouni, Willy Susilo, Joseph Tonien, Abderrahmane Nitaj

Publication date: 13 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-91356-4_3

zbMATH Keywords

continued fractionsCoppersmith's methodlattice reductioncyber attacksRSA variants

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55)

Related Items (2)

A new attack on some RSA variants ⋮ Further cryptanalysis of a type of RSA variants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of RSA with small prime difference
• Cryptanalysis of RSA variants with modified Euler quotient
• A generalized attack on RSA type cryptosystems
• A generalized attack on some variants of the RSA cryptosystem
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• A New Attack on Three Variants of the RSA Cryptosystem
• An Improved Analysis on Three Variants of the RSA Cryptosystem
• Cryptanalysis of short RSA secret exponents
• Cryptanalysis of RSA and Its Variants
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with Private Key d Less than N 0.292

This page was built for publication: Cryptanalysis of RSA variants with primes sharing most significant bits