An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
RSA/Rabin Bits are 1/2 + 1 Poly (Log N) Secure
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
| Hi-index | 0.00 |
We consider the problem of solving systems of equations Pi(x) 驴 0 (mod ni) i = 1... k where Pi are polynomials of degree d and the ni are distinct relatively prime numbers and x ni. We prove that if k d(d+1)/2 we can recover x in polynomial time provided ni 驴 2k. This shows that RSA with low exponent is not a good alternative to use as a public key cryptosystem in a large network. It also shows that a protocol by Broder and Dolev [4] is insecure if RSA with low exponent is used.