New Jochemsz–May Cryptanalytic bound for RSA system utilizing common Modulus N = p2q
This paper describes an attack on the Rivest, Shamir and Adleman (RSA) cryptosystem utilizing the modulus N = p 2 q where p and q are two large balanced primes. Let e1 ,e2 < Nγ be the integers such that d1 , d2 < Nδ be their multiplicative inverses. Based on the two key equations e1d1 −...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Published: |
MDPI
2021
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/94352/ https://www.mdpi.com/2227-7390/9/4/340 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|