Scribd
Upload
98 views15 pages

Rabin Cryptosystem

The Rabin Cryptosystem, invented by Michael Rabin in 1979, is an asymmetric cryptosystem that utilizes a public key for encryption and a private key for decryption, based on quadratic congruence. Key generation involves selecting two large prime numbers, while encryption is straightforward, producing a ciphertext from the square of the plaintext modulo n. However, decryption is complex as it can yield four possible plaintexts, making it less popular compared to RSA.

Uploaded by

dipeshjohree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
98 views15 pages

Rabin Cryptosystem

The Rabin Cryptosystem, invented by Michael Rabin in 1979, is an asymmetric cryptosystem that utilizes a public key for encryption and a private key for decryption, based on quadratic congruence. Key generation involves selecting two large prime numbers, while encryption is straightforward, producing a ciphertext from the square of the plaintext modulo n. However, decryption is complex as it can yield four possible plaintexts, making it less popular compared to RSA.

Uploaded by

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

Rabin Cryptosystem

PRESENTED BY
NAME : RAUSHAN MEHTA
ROLL NO : 206124026
INDEX

 Introduction
 Key Generation
 Encryption Process
 Decryption Process
 Comparison : RSA vs Rabin Cryptosystem
Introduction to Rabin Cryptosystem

 It was invented by Michael Rabin in 1979.


 The Rabin cryptosystem is an asymmetric cryptosystem
that uses a public key for encryption and a private key
for decryption.
 Rabin Cryptosystem is based on quadratic congruence.
 The Rabin cryptosystem can be thought of as an RSA
cryptosystem in which the value of e and d are fixed;
e = 2 and d = 1/2.
Key Generation

 Bob uses these step to create his public key and private
key.
 1) Choose two large prime numbers p and q in the form
(4k+3) and p≠q.
 2) Compute n = p × q (Here, n is the public key).
 3) Keep (p, q) as the private key.
Example: Key Generation

 Let p = 23 and q = 7 (both ≡ 3 mod 4)


 Compute n = p × q = 23 × 7 = 161
 Public key : n = 161
 Private key : (p, q) = (23, 7)
Encryption Process

 Encryption in the Rabin cryptosystem is very simple.


 Alice has to get the public key n.
 Encrypt with the formula : C = p2 mod n
 Alice send C to Bob.
Example: Encryption

 Let Plain text = 24


 Public key : n = 161
 Compute C = (24)² mod 161
= 576 mod 161
= 93
 Ciphertext sent : C = 93
Decryption Process

 Unlike other public-key cryptosystems like RSA, Rabin


Cryptosystem Decryption Process is more complex
because it produces four possible plaintexts instead of just
one.
 Because of this reason Rabin cryptosystem is not
deterministic.
 Also because of this reason it is not as popular as RSA.
Decryption Process

 Obtain the Private Key (p, q).


 Compute Square Roots Modulo n.
sqrt(cipher text) mod n
 we obtain four square roots of c mod n
 Apply the Chinese Remainder Theorem four
times.
 We will get four possible plain text.
Decryption Process
Example: Decryption

 Received Cipher text = 93 and private key (p, q) = (23, 7).


Example : Decryption

 Bob takes four possible answers, (a 1 , b 1 ), (a 1 , b 2 ),


(a 2 , b 1 ), and (a 2 , b 2 ), and uses the Chinese
remainder theorem to find four possible plaintexts.
 After applying CRT we will get these four plaintexts
116, 24, 137, and 45.
Comparison: Rabin vs. RSA

 RSA: Based on exponentiation congruence (e, d) pair,


decryption is easier.
 Rabin: Based on quadratic congruence, faster encryption
but complex decryption.
 RSA is widely used.
 Rabin decryption produces four possible plaintexts due to
which it is rarely used.

You might also like