1997-08-22 - Re: Mathematics > NSA + GCHQ

Header Data

From: John Young <jya@pipeline.com>
To: cypherpunks@toad.com
Message Hash: f72dd82f8406e85f8e6e371197f6aa71a65f906583d8f4ead9a78e2d749dce46
Message ID: <1.5.4.32.19970822193215.00831fc0@pop.pipeline.com>
Reply To: N/A
UTC Datetime: 1997-08-22 19:57:50 UTC
Raw Date: Sat, 23 Aug 1997 03:57:50 +0800

Raw message

From: John Young <jya@pipeline.com>
Date: Sat, 23 Aug 1997 03:57:50 +0800
To: cypherpunks@toad.com
Subject: Re: Mathematics > NSA + GCHQ
Message-ID: <1.5.4.32.19970822193215.00831fc0@pop.pipeline.com>
MIME-Version: 1.0
Content-Type: text/plain



Tim May wrote:

>Thus, as bright as Brian Snow or Don Coppersmith or John Conway may be, the
>"edge" the NSA may have once had is largely gone. Which is not to say that
>they are not still a formidable technical organization, with substantial
>computer resources.
>
>But modern crypto systems are, as we all know, based on fundamental
>mathematical results ...

Along this line:

A few days ago we received an 8-page excerpt from "Shift Register
Sequences," by Solomon W. Golomb (at USC), Holden-Day, Inc., 
no date, with a handwritten note:

   NSA has tried to suppress knowledge of this stuff. Nearly all NSA 'good'
   algorithms are based on this technology.

IANAM, so would any of the mathematicians here give any credibility to 
this claim? We'll scan and put the excerpt on our Web site if worthwhile.
It's composed of the book's 3 page preface and 5 pages of text and
diagrams of Chapter 2 on The Shift Register as a Finite State Machine,
with principal focus on de Bruijn diagrams for shift registers.







Thread