Article View: sci.crypt
Article #4124Re: Fermat's Last Theorem apparently proven
From: Robert D. Silverman
Date: Sun, 13 Mar 1988 03:57
Date: Sun, 13 Mar 1988 03:57
14 lines
1039 bytes
1039 bytes
In article <7440@brl-smoke.ARPA> gwyn@brl.arpa (Doug Gwyn (VLD/VMB) <gwyn>) writes: :In article <977@thumper.bellcore.com> karn@thumper.bellcore.com (Phil R. Karn) writes: :>I wonder what implications this might have for cryptography? : :Probably just as many as a proof of the Riemann hypothesis. Sorry, this is not correct. The proof of FLT by Miyaoka has important implications (it makes some of Falting's results effective, for example) but they are not in cryptography. A proof of the RH would give important cryptographic results. It would mean a fast, deterministic Polynomial Time prime proving algorithm. Bob Silverman
Technical Details
Message-ID:
<26797@linus.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!linus!bsReferences:
<977@thumper.bellcore.com> <7440@brl-smoke.ARPA>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!linus!bs From: bs@linus.UUCP (Robert D. Silverman) Newsgroups: sci.crypt Subject: Re: Fermat's Last Theorem apparently proven Message-ID: <26797@linus.UUCP> Date: 13 Mar 88 03:57:48 GMT References: <977@thumper.bellcore.com> <7440@brl-smoke.ARPA> Reply-To: bs@linus.UUCP (Robert D. Silverman) Organization: The MITRE Corporation, Bedford MA Lines: 14