Extending Pollard class of factorable RSA modulus
Pollard p − 1 method is able to solve integer factorization problem if the targeted composite number has small prime factors. This is a reason why implementation in key generation algorithm of RSA cryptosystem requires its primes, p and q not to be constituted by small primes. In this paper, we show...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2018
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/66533/1/Cryptology2018-5.pdf http://psasir.upm.edu.my/id/eprint/66533/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|