Startseite On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

On the key space of the McEliece cryptosystem based on binary Reed–Muller codes

  • G. A. Karpunin
Veröffentlicht/Copyright: 1. Juli 2004
Veröffentlichen auch Sie bei De Gruyter Brill
Discrete Mathematics and Applications
Aus der Zeitschrift Band 14 Heft 3

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.

Published Online: 2004-07-01
Published in Print: 2004-07-01

Copyright 2004, Walter de Gruyter

Heruntergeladen am 30.11.2025 von https://www.degruyterbrill.com/document/doi/10.1515/1569392031905601/pdf?lang=de
Button zum nach oben scrollen