A public-key cryptosystem based on squaring modulo the product of two primes, introduced in 1979 by Michael O. Rabin and proven to have security reducible to the hardness of integer factorization. It is similar to RSA but uses e=2.
2 years ago
Recent Hot AnswersHow do I attack an RSA setup where e is even?
Why is this authentication procedure using Rabin crypto not useful?
Why is Rabin encryption equivalent to factoring?
Can e = 2 be used in unpadded RSA?
Pseudo Random Generator (PRG) from Rabin function
signature × 8
rsa × 7
encryption × 5
p1363 × 3
factorization × 3
public-key × 2more related tags