Two RSA-based Cryptosystems

TL;DR

This paper introduces new RSA-based cryptosystems, RSA-DFT and RSA-HGR, by integrating primitive mth roots of unity into the Discrete Fourier Transform, enhancing cryptographic methods.

Contribution

It presents novel RSA cryptosystems that incorporate primitive mth roots of unity within the DFT framework, expanding cryptographic techniques.

Findings

Development of RSA-DFT and RSA-HGR cryptosystems

Integration of primitive mth roots of unity into DFT

Potential improvements in cryptographic security

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 mth 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.