Akay Schuster

The Rabin cryptosystem over number fields

2025 · arXiv (Cornell University)

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 …