A generalized attack on RSA type cryptosystems


Let N = pq be an RSA modulus with unknown factorization. Some variants of the RSA cryptosystem, such as LUC, RSA with Gaussian primes and RSA type schemes based on singular elliptic curves use a public key e and a private key d satisfying an equation of the form ed − k ( p − 1 ) ( q − 1 ) = 1. In this paper, we consider the general equation ex− ( p − 1… (More)
DOI: 10.1016/j.tcs.2017.09.009


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics