On the key space of the McEliece cryptosystem based on binary Reed-Muller codes
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378896849 | ||
| 003 | CHVBK | ||
| 005 | 20180305123508.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20040701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/1569392031905601 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/1569392031905601 | ||
| 100 | 1 | |a Karpunin |D G. A. | |
| 245 | 1 | 0 | |a On the key space of the McEliece cryptosystem based on binary Reed-Muller codes |h [Elektronische Daten] |c [G. A. Karpunin] |
| 520 | 3 | |a 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. | |
| 540 | |a Copyright 2004, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/3(2004-07-01), 257-262 |x 0924-9265 |q 14:3<257 |1 2004 |2 14 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/1569392031905601 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1515/1569392031905601 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Karpunin |D G. A. | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/3(2004-07-01), 257-262 |x 0924-9265 |q 14:3<257 |1 2004 |2 14 |o dma | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||