Scribd
Upload
112 views5 pages

Rabin Cryptosystem Explained

The Rabin cryptosystem uses integer factorization to encrypt messages. It works by taking the square of a message m modulo a composite number n to get the ciphertext c. To decrypt, the receiver computes the four square roots of c modulo n, with one being the original message m. It is computationally secure if the factorization of n is unknown, since without the prime factors p and q decryption is infeasible.

Uploaded by

Maddison Charles Jo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
112 views5 pages

Rabin Cryptosystem Explained

The Rabin cryptosystem uses integer factorization to encrypt messages. It works by taking the square of a message m modulo a composite number n to get the ciphertext c. To decrypt, the receiver computes the four square roots of c modulo n, with one being the original message m. It is computationally secure if the factorization of n is unknown, since without the prime factors p and q decryption is infeasible.

Uploaded by

Maddison Charles Jo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Rabin Crypto System

Overview
Murat Kantarcioglu

The Rabin Cryptosystem


• Computationally secure against a chosen
plaintext attack
– Provided that the modulus n = pq can not
be factored.

• n is the public key. The primes p and q are the


private key.

• Choose to simplify the computation of square


roots modulo p and q 2
The Rabin Cryptosystem
• B encrypts a message m and sends the
ciphertext c to A

• Encryption:
– Obtain A’s public key n.
– Represent the message as an integer m in
the range {0, 1, . . . ,n-1}.
– Compute
– Send the ciphertext c to A
3

The Rabin Cryptosystem


• A decrypts the ciphertext c as follows:

• Decryption:
– Compute
– There are four square roots
of c modulo n.
– The message m is equal to one of these four
messages

4
The Rabin Cryptosystem
• When there is a simple formula to
compute the square root of c in mod p.

• Here we have made use of Euler’s criterion to


claim that
5

The Rabin Cryptosystem


• Hence the two square roots of c mod p are

• In a similar fashion, the two square roots of c mod


q are

• Then we can obtain the four square roots of c mod


n using the Chinese Remainder Theorem

6
The Rabin Cryptosystem
• Example:
– Suppose
– Then for message m the ciphertext c is
computed as

– And for decryption we need to compute

– Suppose Alice wants to send message m =


10
7

The Rabin Cryptosystem

• To find the square roots of 23 in mod 7 and in


mod 11 we can use the formula since 7 and
11 are cogruent to 3 mod 4.

8
The Rabin Cryptosystem

• Using the Chinese Remainder


Theorem, we compute the four square
roots of 23 mod 77 to be

• Therefore the four possible plaintexts


are

You might also like