[19065] in bugtraq
Re: Pinoy math enthusiast finds fast way to decode RSA encryption
daemon@ATHENA.MIT.EDU (Thomas Quinot)
Wed Feb 7 17:33:18 2001
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Disposition: inline
Content-Transfer-Encoding: 8bit
Message-Id: <20010207192929.A93899@melusine.cuivre.fr.eu.org>
Date: Wed, 7 Feb 2001 19:29:29 +0100
Reply-To: thomas@cuivre.fr.eu.org
From: Thomas Quinot <thomas@CUIVRE.FR.EU.ORG>
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>; from
pganti@OSF1.GMU.EDU on Tue, Feb 06, 2001 at 09:32:39PM -0500
Le 2001-02-07, Padmapani S Ganti icrivait :
> 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 every integer >= 12 is of that form...
let x integer >= 12.
(x+1)^2 = x^2 + 2x + 1 > x^2 + 24
Therefore there is one N = 1 + 24n which satisfies
x^2 <= N < (x+1)^2
ie x <= sqrt (N) < x+1, which is the definition of
x = int (sqrt (N)).
Thomas.
--
Thomas.Quinot@Cuivre.FR.EU.ORG
