The Rabin cryptosystem revisited
Number Theory
2013-11-05 v3 Cryptography and Security
Information Theory
math.IT
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.
Cite
@article{arxiv.1108.5935,
title = {The Rabin cryptosystem revisited},
author = {Michele Elia and Matteo Piva and Davide Schipani},
journal= {arXiv preprint arXiv:1108.5935},
year = {2013}
}
Comments
minor review + introduction of a deterministic scheme using quartic reciprocity that works for primes congruent 5 modulo 8