2000 character limit reached
Two RSA-based Cryptosystems
Published 17 May 2024 in cs.CR | (2405.11041v1)
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.
- P.J.Davis Circulant Matrices John Wiley & Sons, New York(1979).
- G. Higman The Units of Group Rings Proc. London Math. Soc. 46(1940), 231-248.
- G. Karpilovsky Commuataive Group Algebras Marcel Dekker, No.78(1983).
- William Stalling Cryptography and Network Security, eighth edition Perason Education Limited (2023).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.