G. A. Karpunin
On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
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.
Discrete Mathematics and Applications, Walter de Gruyter
Print ISSN: 0924-9266
Volume: 14, 07/2004
Pages: 257 - 262
Show full article (external site)
Show all available items of this journal
Search
