A Carmichael Killer
- Hi all,
Is searching for A,B,k,h such that A^k = B^h [mod N] in polynomial time ?
I don't think so. It seems hard to find.
My algorithm is strictly in O(log n), finds that N is composite and above all,
always (yes, always !) finds one (or more) factor of N, if N is a PSP, a SPSP or a
Carmichael number and perhaps other types of composite numbers.
Does someone know any similar factoring algorithm ?
For instance, why does Titanix detect Arnault SPSP ? Does it find by the way their factors ?
[Non-text portions of this message have been removed]