Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)
From MaRDI portal
Publication:2671806
DOI10.1016/j.ipl.2022.106263OpenAlexW4213269727WikidataQ113872246 ScholiaQ113872246MaRDI QIDQ2671806
Zekeriya Y. Karatas, Erkam Luy, Olcay Ciftci
Publication date: 3 June 2022
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106263
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of RSA for a special case with \(d > e\)
- Low-Exponent RSA with Related Messages
- Cryptanalysis of short RSA secret exponents
- A method for obtaining digital signatures and public-key cryptosystems
- Forty years of attacks on the RSA cryptosystem: A brief survey
- A Modified Technique for Reliable Image Encryption Method using Merkle-Hellman Cryptosystem and Rsa Algorithm
- An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding
- Comment and modification of RSA based remote password authentication using smart card
This page was built for publication: Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)