Thread View: sci.crypt
2 messages
2 total messages
Started by pgut1@cs.aukuni.
Mon, 15 Feb 1993 01:27
PGP IV: The Search for Sidelnikov
Author: pgut1@cs.aukuni.
Date: Mon, 15 Feb 1993 01:27
Date: Mon, 15 Feb 1993 01:27
35 lines
1975 bytes
1975 bytes
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. -- pgut1@cs.aukuni.ac.nz||p_gutmann@cs.aukuni.ac.nz||gutmann_p@kosmos.wcc.govt.nz peterg@kcbbs.gen.nz||peter@nacjack.gen.nz||peter@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? --
Re: PGP IV: The Search for Sidelnikov
Author: bontchev@fbihh.i
Date: Mon, 15 Feb 1993 12:47
Date: Mon, 15 Feb 1993 12:47
25 lines
1311 bytes
1311 bytes
pgut1@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: bontchev@fbihh.informatik.uni-hamburg.de D-2000 Hamburg 54, Germany
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads