An attack on a modified niederreiter encryption scheme

Authors:
Christian Wieschebrink
Affiliations:
Federal Office for Information Security (BSI), Bonn, Germany
Venue:
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Year:
2006

Citing 4
Cited 4

An observation on the security of McEliece's public-key cryptosystem

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
How to Mask the Structure of Codes for a Cryptographic Use

Designs, Codes and Cryptography
A new structural attack for GPT and variants

Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia

Cryptanalysis of the niederreiter public key scheme based on GRS subcodes

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
The non-gap sequence of a subcode of a generalized Reed---Solomon code

Designs, Codes and Cryptography
On the unique representation of very strong algebraic geometry codes

Designs, Codes and Cryptography
Computational aspects of retrieving a representation of an algebraic geometry code

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [1] a Niederreiter-type public-key cryptosystem based on subcodes of generalized Reed-Solomon codes is presented. In this paper an algorithm is proposed which is able to recover the private key of the aforementioned system from the public key and which is considerably faster than a brute force attack. It is shown that the example parameters proposed in [1] are insecure.