It is well known that if one can factor the modulus R = pq (p, q distinct large primes) of the RSA cryptosystem , then the system can be broken. However, it is not known whether the problem of breaking an RSA cryptosystem is equivalent in difficulty to factoring R. Rabin  has given a publik-key encryption method which is as difficult to break as it is to factor R, but the decryption process produces four possible candidates for the correct message and only one of these is the correct redundancy (e.g., a cryptographic key) there is no way for the sender to allow the recipient to identify the correct message being transmitted. Also, in  Lipton has pointed out some other weaknesses in the scheme when it is used as a cryptosystem. Indeed, Rabin only advocated its use as a signature system.
Swipe to navigate through the chapters of this book
- Some Public-Key Crypto-Functions as Intractable as Factorization
H. C. Williams
- Springer Berlin Heidelberg
- Sequence number