The Rabin cryptosystem is a family of public-key encryption schemes based on a trapdoor function whose security, like RSA's, rests on the difficulty of integer factorization. Unlike RSA, inverting the Rabin trapdoor function has been mathematically proven to be as hard as factoring integers, though each output of the function can be generated by any of four possible inputs, which requires extra complexity on decryption to identify the true plaintext among them. Public-key schemes built on the Rabin trapdoor function are used mainly as textbook examples, while RSA remains the basis of the standard schemes used in practice.
Connections
Associated With
RSA Algorithm, Concepts Verified en.wikipedia.org/wiki/Rabin_cryptosystem: "The Rabin cryptosystem is a family of public-key encryption schemes based on a trapdoor function whose security, like that of RSA, is related to the difficulty of integer factorization."
Invented By
Verified en.wikipedia.org/wiki/Rabin_cryptosystem: "The Rabin trapdoor function was first published as part of the Rabin signature scheme in 1978 by Michael O. Rabin." The Rabin cryptosystem (1979 encryption scheme) shares this same trapdoor construction.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.