The Rabin cryptosystem revisited

2011/08/30 by Michele Elia, Elia, Michele, Matteo Piva +3 · 2 citations
Computer Science · #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1108.5935

openalex publication_date 2011/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Rabin public-key cryptosystem is revisited with a focus on the problem of identifying the encrypted message unambiguously for any pair of primes. In particular, a deterministic scheme using quartic reciprocity is described that works for primes congruent 5 modulo 8, a case that was still open. Both theoretical and practical solutions are presented. The Rabin signature is also reconsidered and a deterministic padding mechanism is proposed.

Cited by

• Rabin-p Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme
• The Rabin cryptosystem over number fields

Related

• Rabin-p Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme
• The Rabin cryptosystem over number fields
• Crashing Modulus Attack on Modular Squaring for Rabin Cryptosystem
• Minimizing the Time of Detection of Large (Probably) Prime Numbers
• A New Efficient Asymmetric Cryptosystem Based on the Square Root Problem