Tech Insider					     Technology and Trends


			      USENET Archives

Xref: sparky sci.crypt:7512 alt.security.pgp:671
Path: sparky!uunet!comp.vuw.ac.nz!waikato.ac.nz!aukuni.ac.nz!
cs18.cs.aukuni.ac.nz!pgut1
Newsgroups: sci.crypt,alt.security.pgp
Subject: PGP IV: The Search for Sidelnikov
Message-ID: <1993Feb15.012716.21430@cs.aukuni.ac.nz>
From: pg...@cs.aukuni.ac.nz (Peter Gutmann)
Date: Mon, 15 Feb 1993 01:27:16 GMT
Organization: Computer Science Dept. University of Auckland
Lines: 37

I was reading through a weighty tome on error-correcting codes (BTW a related
volume, "A Commonsense Approach to the Theory of Error-Correcting Codes" is the
only place you'll ever see the terms "theory of error-correcting codes" and
"commonsense" used in the same sentence) when I noticed a reference to a proof
("too complicated to give here") related to BCH codes by Sidel'nikov.  Checking
the list of references gave:
 
  V.M.Sidelnikov "Some k-valued pseudo-random sequences and nearly equidistant
    codes", Problems of Info.Trans, 5[1] (1969), p.12-16.
 
  V.M.Sidelnikov "Weight spectrum of binary BCH codes", Problems of Info.Trans,
    7[1] (1971), p.11-17.
 
  V.M.Sidelnikov "On the densest packing of balls on the surface of an n-
    dimensional Euclidean sphere and the number of binary code vectors with a 
    given code distance", Soviet Math Doklady, 14 (1973), p.1851-1855.
 
  V.M.Sidelnikov "Upper bounds for the number of points of a binary code with a
    specified code distance", Problems of Info.Trans, 10[2] (1974), p.124-131,
    and Info.Control 28 (1975), p.292-303.
 
Now given that anyone who can produce a proof of a theorm which is too complex
to be included in a volume on the theory of ECC's must be an absolute
genius :-), this lends somewhat more weight to his findings.  It also gives a
(rather remote) chance of finding him:  Chances are that "Problems of Info.
Trans" is published by the Institute for the Problems of Information
Transmission (can someone confirm this?) whose email address is ippi.msk.su.
Although he probably isn't there any more (it was 20 years ago), someone there
may know how to contact him.....
 
Peter.
--
 pg...@cs.aukuni.ac.nz||p_gu...@cs.aukuni.ac.nz||gutm...@kosmos.wcc.govt.nz
pet...@kcbbs.gen.nz||pe...@nacjack.gen.nz||pe...@phlarnschlorpht.nacjack.gen.nz
             (In order of preference - one of 'em's bound to work)
     -- Do you have a backup of the data you used to have on this disk? --

Xref: sparky sci.crypt:7524 alt.security.pgp:672
Newsgroups: sci.crypt,alt.security.pgp
Path: sparky!uunet!math.fu-berlin.de!ira.uka.de!Sirius.dfn.de!
news.DKRZ-Hamburg.DE!rzsun2.informatik.uni-hamburg.de!fbihh!bontchev
From: bont...@fbihh.informatik.uni-hamburg.de (Vesselin Bontchev)
Subject: Re: PGP IV: The Search for Sidelnikov
Message-ID: <bontchev.729780456@fbihh>
Sender: ne...@informatik.uni-hamburg.de (Mr. News)
Reply-To: bont...@fbihh.informatik.uni-hamburg.de
Organization: Virus Test Center, University of Hamburg
References: <1993Feb15.012716.21430@cs.aukuni.ac.nz>
Date: 15 Feb 93 12:47:36 GMT
Lines: 26

pg...@cs.aukuni.ac.nz (Peter Gutmann) writes:

[short list of Sidelnikov's papers deleted]

> Now given that anyone who can produce a proof of a theorm which is too complex
> to be included in a volume on the theory of ECC's must be an absolute
> genius :-), this lends somewhat more weight to his findings.  It also gives a
> (rather remote) chance of finding him:  Chances are that "Problems of Info.

No need to do that; we've found him. We've even got his office and
private phone numbers. Sorry, no fax or e-mail. I spoke with him. He
told me that the evaluation of PGP has been ordered by a commercial
customer but the results have been never published. He claims that the
person who has published the original electronic message has done this
incompetently and without permission. (Actually, he used the word
"stollen".) He refused to make -any- comments about any deficiencies
in PGP, except that he insists on his results and won't supply any
further information.

Regards,
Vesselin
-- 
Vesselin Vladimirov Bontchev          Virus Test Center, University of Hamburg
Tel.:+49-40-54715-224, Fax: +49-40-54715-226      Fachbereich Informatik - AGN
< PGP 2.1 public key available on request. > Vogt-Koelln-Strasse 30, rm. 107 C
e-mail: bont...@fbihh.informatik.uni-hamburg.de    D-2000 Hamburg 54, Germany

			        About USENET

USENET (Users’ Network) was a bulletin board shared among many computer
systems around the world. USENET was a logical network, sitting on top
of several physical networks, among them UUCP, BLICN, BERKNET, X.25, and
the ARPANET. Sites on USENET included many universities, private companies
and research organizations. See USENET Archives.

		       SCO Files Lawsuit Against IBM

March 7, 2003 - The SCO Group filed legal action against IBM in the State 
Court of Utah for trade secrets misappropriation, tortious interference, 
unfair competition and breach of contract. The complaint alleges that IBM 
made concentrated efforts to improperly destroy the economic value of 
UNIX, particularly UNIX on Intel, to benefit IBM's Linux services 
business. See SCO v IBM.

The materials and information included in this website may only be used
for purposes such as criticism, review, private study, scholarship, or
research.

Electronic mail:			       WorldWideWeb:
   tech-insider@outlook.com			  http://tech-insider.org/