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
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
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On the number of closure-type mappings
- Spectral properties of a linear congruent generator in special cases
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- Simulation of circuits of functional elements by the universal Turing machine
- Implementation of Markov chains over Galois fields
- On solving automaton equations
- Boundaries of random triangulation of a disk
- On the accuracy of approximation in the Poisson limit theorem
Artikel in diesem Heft
- On the number of closure-type mappings
- Spectral properties of a linear congruent generator in special cases
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- Simulation of circuits of functional elements by the universal Turing machine
- Implementation of Markov chains over Galois fields
- On solving automaton equations
- Boundaries of random triangulation of a disk
- On the accuracy of approximation in the Poisson limit theorem