The Rabin cryptosystem over number fields
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913889257521152 |
|---|---|
| author | Cobbe, Alessandro Nickel, Andreas Schuster, Akay |
| author_facet | Cobbe, Alessandro Nickel, Andreas Schuster, Akay |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09569 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Rabin cryptosystem over number fields Cobbe, Alessandro Nickel, Andreas Schuster, Akay Cryptography and Security Number Theory 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. |
| title | The Rabin cryptosystem over number fields |
| topic | Cryptography and Security Number Theory |
| url | https://arxiv.org/abs/2506.09569 |