Paper 2024/939

Two RSA-based Cryptosystems

A. Telveenus, Kingston University London International Study Centre
Abstract

The cryptosystem RSA is a very popular cryptosystem in the study of Cryptography. In this article, we explore how the idea of a primitive m th root of unity in a ring can be integrated into the Discrete Fourier Transform, leading to the development of new cryptosystems known as RSA-DFT and RSA-HGR.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. arXiv.2405.11041
DOI
10.48550/arXiv.2405.11041
Keywords
Primitive m th roots of unityhalidon ringshalidon group ringsRSA cryptosystemDiscrete Fourier Transform
Contact author(s)
t fernandezantony @ kingston ac uk
History
2024-06-12: approved
2024-06-11: received
See all versions
Short URL
https://ia.cr/2024/939
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/939,
      author = {A. Telveenus},
      title = {Two {RSA}-based Cryptosystems},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/939},
      year = {2024},
      doi = {10.48550/arXiv.2405.11041},
      url = {https://eprint.iacr.org/2024/939}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.