[Resource Topic] 2006/092: Cryptanalysis of RSA with constrained keys

Welcome to the resource topic for 2006/092

Cryptanalysis of RSA with constrained keys

Authors: Abderrahmane Nitaj


Let n=pq be an RSA modulus with unknown prime factors and F any function for which there exists an integer u\neq 0 satisfying F(u)\approx n and pu or qu is computable from F(u) and n. We show that choosing a public key exponent e for which there exist positive integers X, Y such that \left\vert eY-XF(u)\right\vert and Y are suitably small, then the system is insecure.

ePrint: https://eprint.iacr.org/2006/092

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 .