Re: Pinoy math enthusiast finds fast way to decode RSA encryption

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 "Lacroix, Robert" [EMAIL PROTECTED] writes: # This algorithm efficiently solves problems of the form 2^x = aN + 1, # using O(log N) storage and O(log N)(log N) time. Sorry to be a wet blanket, but it should be "O(N) time". As a factoring method,

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

Hi Everybody., I just wanted to add a thing to the prime number which i found independently and i do not know whether this has been achieved earlier or not but i have a way of proving that every prime is of the form (int)sq.root(1+24n) of course excepting 2 and 3.This is a result derived from the

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

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.

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

Le 2001-02-07, Padmapani S Ganti crivait : I just wanted to add a thing to the prime number which i found independently and i do not know whether this has been achieved earlier or not but i have a way of proving that every prime is of the form (int)sq.root(1+24n) Not very interesting, since

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

On Tue, 6 Feb 2001, Padmapani S Ganti wrote: I just wanted to add a thing to the prime number which i found independently and i do not know whether this has been achieved earlier or not but i have a way of proving that every prime is of the form (int)sq.root(1+24n) May I add, that every

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

#!/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

Pinoy math enthusiast finds fast way to decode RSA encryption

The following link was sent to me this morning. Has anybody heard about this, gotten any more info? Is this TRUE? :-) http://www.mb.com.ph/INFO/2001-02/IT020201.asp Andre -- andre.delafontaine at echostar.com F20 DSS: BD75 66D9 5B2C 66CE 9158 BB27 B199 59CE D117 4E9F F16

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

There is an extension to theis, explaining the thinking, at http://www.mb.com.ph/INFO/2001-02/IT020601.asp -- Howard. LANNet Computing Associates http://lannetlinux.com "...well, it worked before _you_ touched it!" On Mon, 5 Feb 2001,

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On Mon, Feb 05, 2001 at 09:01:33AM -0700, Andre Delafontaine wrote: The following link was sent to me this morning. Has anybody heard about this, gotten any more info? Is this TRUE? :-) http://www.mb.com.ph/INFO/2001-02/IT020201.asp In what

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

yes, but the attack does not work (efficiently). We analyzed it together with Ariel Futoransky and Calos Sarraute and judged it highly impractical (no complexity estimates could be found on the post/news). Later we read a mail which was signed by Rivest himself in which he said that the attack

Re: Pinoy math enthusiast finds fast way to decode RSA encryption

I doubt it... http://www.seedmuse.com/rsa_edit.htm -Original Message- From: Andre Delafontaine [mailto:[EMAIL PROTECTED]] Sent: Monday, February 05, 2001 11:02 AM To: [EMAIL PROTECTED] Subject: Pinoy math enthusiast finds fast way to decode RSA encryption The following link was sent