Geodesic
On the McEliece public-key cryptosystem based on Reed-Muller binary codes
Diskretnaya Matematika, Tome 16 (2004) no. 2, pp. 79-84 
G. A. Karpunin. On the McEliece public-key cryptosystem based on Reed-Muller binary codes. Diskretnaya Matematika, Tome 16 (2004) no. 2, pp. 79-84. http://geodesic.mathdoc.fr/item/DM_2004_16_2_a4/
@article{DM_2004_16_2_a4,
     author = {G. A. Karpunin},
     title = {On the {McEliece} public-key cryptosystem based on {Reed-Muller} binary codes},
     journal = {Diskretnaya Matematika},
     pages = {79--84},
     year = {2004},
     volume = {16},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2004_16_2_a4/}
}
TY  - JOUR
AU  - G. A. Karpunin
TI  - On the McEliece public-key cryptosystem based on Reed-Muller binary codes
JO  - Diskretnaya Matematika
PY  - 2004
SP  - 79
EP  - 84
VL  - 16
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_2004_16_2_a4/
LA  - ru
ID  - DM_2004_16_2_a4
ER  - 
%0 Journal Article
%A G. A. Karpunin
%T On the McEliece public-key cryptosystem based on Reed-Muller binary codes
%J Diskretnaya Matematika
%D 2004
%P 79-84
%V 16
%N 2
%U http://geodesic.mathdoc.fr/item/DM_2004_16_2_a4/
%G ru
%F DM_2004_16_2_a4

Voir la notice de l'article provenant de la source Math-Net.Ru

We study the McEliece cryptosystem with $u$-fold use of binary Reed–Muller codes $\mathit{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$.

[1] McEliece R. J., “A public-key cryptosystem based on algebraic coding theory”, DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, 1978, 114–116

[2] Sidelnikov V. M., “Otkrytoe shifrovanie na osnove dvoichnykh kodov Rida–Mallera”, Diskretnaya matematika, 6:2 (1994), 3–20 | MR | Zbl

[3] Sidelnikov V. M., Pershakov A. S., “Dekodirovanie kodov Rida–Mallera pri bolshom chisle oshibok”, Probl. peredachi informatsii, 28:3 (1992), 80–94 | MR

[4] Mak-Vilyams F. Dzh., Sloen N. Dzh., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, Moskva, 1979