Abstract
This article introduced a new generalized RSA crypto-system based on $ 2n $ prime numbers called generalized RSA (GRSA). This is a modern technique to provide supreme security for the computer world by factoring the variable$ N $, where its analysis process has become much easier nowadays with the development of tools and equipment. $ 2n $ primes (prime numbers) are used in the GRSA crypto-system to provide security over the network system. This includes encryption, key generation, and decryption. In this method we used $ 2n $ primes which are not easily broken, $ 2n $ primes are not comfortably demented. This method provides greater performance and fidelity over the network system.
| Original language | English |
|---|---|
| Pages (from-to) | 18833-18845 |
| Number of pages | 13 |
| Journal | AIMS Mathematics |
| Volume | 8 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 2023 |
Keywords
- RSA cryptosystem
- generalized RSA cryptosystem
- primes
- key generation
- encryption
- decryption
- private key
- public key
Fingerprint
Dive into the research topics of 'Generalization of RSA cryptosystem based on 2n primes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver