Article View: sci.crypt
Article #4131Re: Fermat's Last Theorem apparently proven
From: Doug Gwyn
Date: Mon, 14 Mar 1988 04:10
Date: Mon, 14 Mar 1988 04:10
12 lines
1247 bytes
1247 bytes
In article <26822@linus.UUCP> bs@linus.UUCP (Robert D. Silverman) writes: =In article <7449@brl-smoke.ARPA> gwyn@brl.arpa (Doug Gwyn (VLD/VMB) <gwyn>) writes: =:In article <26797@linus.UUCP> bs@linus.UUCP I wrote: =:-A proof of the RH would give important cryptographic results. =:-It would mean a fast, deterministic Polynomial Time prime proving algorithm. =:What advantage would a formal proof of RH =:(that perhaps few could understand anyway) bring to that effort? =I think you are being deliberately obtuse and pedantic. No, somehow I must have had the mistaken impression that you were talking about PRACTICAL cryptography, for example cryptanalysis (for which the proof of the pudding is in the eating), rather than some academic exercise.
Technical Details
Message-ID:
<7453@brl-smoke.ARPA>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!cmcl2!brl-adm!brl-smoke!gwynReferences:
<977@thumper.bellcore.com> <7440@brl-smoke.ARPA> <26797@linus.UUCP> <7449@brl-smoke.ARPA> <26822@linus.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!cmcl2!brl-adm!brl-smoke!gwyn From: gwyn@brl-smoke.ARPA (Doug Gwyn ) Newsgroups: sci.crypt Subject: Re: Fermat's Last Theorem apparently proven Message-ID: <7453@brl-smoke.ARPA> Date: 14 Mar 88 04:10:25 GMT References: <977@thumper.bellcore.com> <7440@brl-smoke.ARPA> <26797@linus.UUCP> <7449@brl-smoke.ARPA> <26822@linus.UUCP> Reply-To: gwyn@brl.arpa (Doug Gwyn (VLD/VMB) <gwyn>) Organization: Ballistic Research Lab (BRL), APG, MD. Lines: 12