In Rabin's oblivious transfer protocol, the sender generates an RSA public modulus "N"="pq" where "p" and "q" are large prime numbers, and an exponent "e" relatively prime to "λ(N)" = ("p" − 1)("q" − 1).