Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy
This paper presents a cryptanalytic approach on the variants of the RSA which utilizes the modulus N = p2q where p and q are balanced large primes. Suppose satisfying gcd(e, ϕ(N)) = 1 where ϕ(N) = p(p − 1)(q − 1) and d < Nδ be its multiplicative inverse. From ed − kϕ(N) = 1, by utilizing the ext...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Published: |
Public Library of Science
2021
|