An attack on N = p2q with partially known bits on the multiple of the prime factors
This paper presents a cryptanalytic study upon the modulus N = p 2q consisting of two large primes that are in the same-bit size. In this work, we show that the modulus N is factorable if e satisfies the Diophantine equation of the form ed − k(N − (ap)2 − apbq + ap) = 1 where ab is an unknown appro...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Published: |
Universiti Putra Malaysia
2021
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/95820/ https://einspem.upm.edu.my/journal |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|