## Attacking the chor-rivest cryptosystem by improved lattice reduction

`We introduce algorithms for lattice basis reduction that are improvements of the famous L3-algorithm. If a random L3-reduced lattice basis b1,b2,...,bn is given such that the vector of reduced Gram-Schmidt coefficients (`
`We introduce algorithms for lattice basis reduction that are improvements of the famous L3-algorithm. If a random L3-reduced lattice basis b1,b2,...,bn is given such that the vector of reduced Gram-Schmidt coefficients ({µi,j} 1<= j< i<= n) is uniformly distributed in [0,1)n(n-1)/2, then the pruned enumeration finds with positive probability a shortest lattice vector. We demonstrate the power of these algorithms by solving random subset sum problems of arbitrary density with 74 and 82 many weights, by breaking the Chor-Rivest cryptoscheme in dimensions 103 and 151 and by breaking Damgard's hash function.` Author: Claus Peter Schnorr, Horst Helmut Hörner urn:nbn:de:hebis:30-12367 http://www.mi.informatik.uni-frankfurt.de/research/papers.html Preprint English 2005/07/13 1995 Universitätsbibliothek Johann Christian Senckenberg 2005/07/13 `Preprint, später in: Advances in Cryptology - Eurocrypt '95 Lecture Notes in Computer Science, Vol. 921, Springer Verlag, 1995, S. 1-12` Advances in Cryptology - Eurocrypt '95 Lecture Notes in Computer Science, Vol. 921, Springer Verlag, pp. 1-12, 1995 , http://www.mi.informatik.uni-frankfurt.de/research/papers.html 22477297X Mathematik Informatik 510 Mathematik Universitätspublikationen Veröffentlichungsvertrag für Publikationen
{"ft_lang_label":"__label__en","ft_lang_prob":0.6067258,"math_prob":0.65926194,"size":1828,"snap":"2020-10-2020-16","text_gpt3_token_len":494,"char_repetition_ratio":0.091008775,"word_repetition_ratio":0.34080717,"special_character_ratio":0.25273523,"punctuation_ratio":0.20118344,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9914292,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-28T22:34:39Z\",\"WARC-Record-ID\":\"<urn:uuid:79a7d6ee-b2cd-4577-aee7-d0275bb1076c>\",\"Content-Length\":\"14920\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:039220b8-5c4a-49db-bf92-e41efa1e043f>\",\"WARC-Concurrent-To\":\"<urn:uuid:a5da1e37-6b75-4911-b104-3177c3dec368>\",\"WARC-IP-Address\":\"141.2.140.22\",\"WARC-Target-URI\":\"http://publikationen.ub.uni-frankfurt.de/opus4/frontdoor/index/index/year/2005/docId/4251\",\"WARC-Payload-Digest\":\"sha1:3T73I25EI7IMME7SY3R355NSDIDYOQDC\",\"WARC-Block-Digest\":\"sha1:CKHJFDF3GEA6Q2N6GFCFYQKEFVTT2MIQ\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875147647.2_warc_CC-MAIN-20200228200903-20200228230903-00083.warc.gz\"}"}