Welcome to the resource topic for 2021/1632
Title:
Cryptanalysis of RSA Variants with Primes Sharing Most Significant Bits
Authors: Meryem Cherkaoui-Semmouni, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
Abstract:We consider four variants of the RSA cryptosystem with an RSA modulus N=pq where the public exponent e and the private exponent d satisfy an equation of the form ed-k\left(p^2-1\right)\left(q^2-1\right)=1. We show that, if the prime numbers p and q share most significant bits, that is, if the prime difference |p-q| is sufficiently small, then one can solve the equation for larger values of d, and factor the RSA modulus, which makes the systems insecure.
ePrint: https://eprint.iacr.org/2021/1632
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .