[19057] in bugtraq
Re: Pinoy math enthusiast finds fast way to decode RSA encryption
daemon@ATHENA.MIT.EDU (Padmapani S Ganti)
Wed Feb 7 12:55:51 2001
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Message-ID: <Pine.OSF.4.21.0102062128340.6648-100000@osf1.gmu.edu>
Date: Tue, 6 Feb 2001 21:32:39 -0500
Reply-To: Padmapani S Ganti <pganti@OSF1.GMU.EDU>
From: Padmapani S Ganti <pganti@OSF1.GMU.EDU>
X-To: "Lacroix, Robert" <ralacroix@HYDRO.MB.CA>
To: BUGTRAQ@SECURITYFOCUS.COM
In-Reply-To: <9BC8CAC649FCD211ABE90008C7089570064C94B6@mail02.hydro.mb.ca>
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 fact that
every prime has to be of the form 6n+1 or 6n-1 . I used GNU Octave on a
LInux box o generate 70 primes scanning 2000 values of n in a second and i
am still finding ways of improving on this.any comments on this one i
would most gladly answer them.Thank you for the time
Padmapani S Ganti
George Mason University.,
Fairfax, VA 22030-4444
703 993 1681
mason.gmu.edu/~pganti
