Paperlane

no. 12 · Tuesday 10 November 2026

The Rabin cryptosystem over number fields

Alessandro Cobbe, Andreas Nickel and Akay Schuster

math.NT · v2 · 16 pp

Abstract

We extend Rabin's cryptosystem to general number fields. We show that recovery of a random plaintext from its ciphertext is as hard as the integer factorisation problem, provided the modulus in our scheme has been chosen carefully. We investigate the performance of our new cryptosystem in comparison with the classical Rabin scheme and a more recent version over the Gaussian integers.

comments
16 pages; several changes according to referee's report
fields
Number Theory
pdf ↗ page arXiv:2506.09569 ↗