The Rabin cryptosystem revisited
Michele Elia, Matteo Piva, Davide Schipani
TL;DR
This paper revisits the Rabin cryptosystem, providing new deterministic methods for message identification and signature padding, especially addressing primes congruent to 5 mod 8, with both theoretical and practical solutions.
Contribution
It introduces a deterministic scheme using quartic reciprocity for primes congruent to 5 mod 8 and proposes a new padding mechanism for Rabin signatures.
Findings
Deterministic message identification scheme for primes 5 mod 8
Practical implementation of the quartic reciprocity-based method
New deterministic padding for Rabin signatures
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Chaos-based Image/Signal Encryption · Cryptographic Implementations and Security