The Rabin cryptosystem over number fields
Cryptography and Security
2025-06-12 v1 Number Theory
Abstract
We extend Rabin's cryptosystem to general number fields. We show that decryption of a random plaintext 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.
Keywords
Cite
@article{arxiv.2506.09569,
title = {The Rabin cryptosystem over number fields},
author = {Alessandro Cobbe and Andreas Nickel and Akay Schuster},
journal= {arXiv preprint arXiv:2506.09569},
year = {2025}
}