No label defined (Q4665033)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2154508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2154508 |
Statements
9 April 2005
0 references
Public-key cryptography
0 references
McEliece cryptosystem
0 references
Niederreiter cryptosystem
0 references
finite fields
0 references
linear error correcting codes
0 references
rational Goppa codes
0 references
syndrome decoding
0 references
proof of security
0 references
digital signature.
0 references
0.8781627416610718
0 references
0.8648051023483276
0 references
0.8631249070167542
0 references
0.8596078157424927
0 references
The author discusses the main aspects of the McEliece cryptosystem and its dual Niederreiter's variant. In these systems, the ciphertext is a corrupted codeword (or its syndrome) and the decryption consists in applying a decoding procedure. It is assumed that these systems use rational binary Goppa codes which provide probably the best choice at present time. In \(\S 2\) the author presents the encryption schemes and describes in \(\S 3\) how they can be implemented. The \(\S 4\) is devoted to cryptanalysis which are divided into two categories: the decoding attacks which are directed on one particular ciphertext, and the structural attacks aimed on the public key. In \(\S 5\) the author presents the main features of the digital signature schemes, and finally in \(\S 6\) he formally proves that the breaking code-based public-key cryptosystem is at least as hard as solving one out of two supposedly difficult problems: the distinguishability of rational Goppa codes and the decoding of a linear code with Goppa parameters. In conclusion, the author notes that the security of McEliece (and Niederreiter) cryptosystem is good in all aspects and encryption and decryption have a very low algorithmic complexity, though the signing cost of the digital signature scheme is relatively high. Other serious drawbacks are an information rate strictly smaller than one, and a very large key size. For the entire collection see [Zbl 1054.94001].
0 references