[19071] in bugtraq
Re: Pinoy math enthusiast finds fast way to decode RSA encryption
daemon@ATHENA.MIT.EDU (Markus Senoner)
Wed Feb 7 18:15:49 2001
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Message-Id: <Pine.LNX.4.10.10102071925060.7843-100000@giotto.dnet.it>
Date: Wed, 7 Feb 2001 19:31:10 +0100
Reply-To: Markus Senoner <markus@DNET.IT>
From: Markus Senoner <markus@DNET.IT>
X-To: Padmapani S Ganti <pganti@OSF1.GMU.EDU>
To: BUGTRAQ@SECURITYFOCUS.COM
In-Reply-To: <Pine.OSF.4.21.0102062128340.6648-100000@osf1.gmu.edu>
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 prime is of the form (int)(1+n),
which is much more simpler to calculate. I can prove this too. :-)
Your formula simply gives a list of *all* numbers (some even multiple
times, the bigger n, the more results: for n=7 and n=8 both give 13,
while for n=6, the formula gives 12, which is not a prime).
:-)
Markus
--
