caa a22 4500 378896849 CHVBK 20180305123508.0 cr unu---uuuuu 161128e20040701xx s 000 0 eng 10.1515/1569392031905601 doi (NATIONALLICENCE)gruyter-10.1515/1569392031905601 Karpunin G. A. On the key space of the McEliece cryptosystem based on binary Reed-Muller codes [Elektronische Daten] [G. A. Karpunin] We study the McEliece cryptosystem with u-fold use of binary Reed-Muller codes RM(r, m). This modification of the McEliece cryptosystem was proposed by V. M. Sidelnikov in 1994 and combines high cryptographic security, transmission rate close to one, and moderate complexity of both enciphering and deciphering. For arbitrary values of the parameters u, r, and m we give an upper bound for the cardinality of the set of public keys of this cryptosystem and calculate its exact value in the case of u = 2 and r = 1. Copyright 2004, Walter de Gruyter Discrete Mathematics and Applications Walter de Gruyter 14/3(2004-07-01), 257-262 0924-9265 14:3<257 2004 14 dma https://doi.org/10.1515/1569392031905601 text/html Onlinezugriff via DOI 1 research article jats NATIONALLICENCE 856 40 https://doi.org/10.1515/1569392031905601 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Karpunin G. A. NATIONALLICENCE 773 0- Discrete Mathematics and Applications Walter de Gruyter 14/3(2004-07-01), 257-262 0924-9265 14:3<257 2004 14 dma CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-gruyter