In response to Taneli Huuskonen [mailto:[EMAIL PROTECTED]]
Sorry to inflict this crapto on you. I came up with the algorithm when I
read Ariel Waissbein's post.
Waissbein said...
check if a number of size 2^1024, e.g. 2^(2^1024), is
congruent to 1 modulo the public exponent n.
#!/usr/local/bin/perl -w
# getcycle.pl
# (Copyright) Robert A. Lacroix, Feb. 6, 2001; Winnipeg, Canada
# This algorithm efficiently solves problems of the form 2^x = aN + 1,
# using O(log N) storage and O(log N)(log N) time.
# I am reinventing the wheel, or is it "Goodbye, RSA?"
# Input
