A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Generalised Cycling Attacks on RSA and Strong RSA Primes
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
| Hi-index | 0.00 |
In this contribution two conditions are stated which safe RSA moduli n = pċq must fulfill. Otherwise the factors of n can be found. First we consider the cycle-lengths of the recursion c ← cφv;(n)-1 +1 mod n which leads to a condition in terms of Fibonacci numbers. The second condition involves a property of Euler's function. We introduce a number-theoretic distance measure - the power-of-two distance (ptd) - which may be useful for evaluating the security of RSA moduli against 'number-theoretic integration'. The ptd of an RSA prime p must not be too small.