An observation on the security of McEliece's public-key cryptosystem
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A symmetric version of the McEliece public-key cryptosystem
International Journal of Network Management
Smaller decoding exponents: ball-collision decoding
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
| Hi-index | 0.00 |
Based on an idea by Hin, the method of obtaining the original message after selecting k of n coordinates at random in the McEliece public-key cryptosystem is improved. The attack, which is more efficient than the attacks previously proposed, is characterized by a systematic method of checking and by a random bit swapping procedure. An optimization procedure similar to the one proposed by Lee and Brickell is used to improve the attack. The attack is highly suitable for parallel and pipelined implementation. The work factor and the values, which yield 'maximum' security for the system are given.It is shown that the public-key can be reduced to k 脳 (n - k) bits.