Xref: sparky sci.crypt:7512 alt.security.pgp:671
Subject: PGP IV: The Search for Sidelnikov
From: pg...@cs.aukuni.ac.nz (Peter Gutmann)
Date: Mon, 15 Feb 1993 01:27:16 GMT
Organization: Computer Science Dept. University of Auckland
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 (1969), p.12-16.
V.M.Sidelnikov "Weight spectrum of binary BCH codes", Problems of Info.Trans,
7 (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 (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.....
(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
From: bont...@fbihh.informatik.uni-hamburg.de (Vesselin Bontchev)
Subject: Re: PGP IV: The Search for Sidelnikov
Sender: ne...@informatik.uni-hamburg.de (Mr. News)
Organization: Virus Test Center, University of Hamburg
Date: 15 Feb 93 12:47:36 GMT
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
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