arXiv · 2506.09569
The Rabin cryptosystem over number fields
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.
Explore related subjects
Keep this discovery
Alessandro Cobbe, Andreas Nickel, Akay Schuster. 2025-06-11. The Rabin cryptosystem over number fields. https://arxiv.org/abs/2506.09569
Cite the original work for its findings. Save a collection to share your selection of sources.