Conference ProceedingsOPEN ACCESS

Cryptanalysis of the Sidelnikov cryptosystem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4515 LNCS 347-360
DOI: 10.1007/978-3-540-72540-4_20
93Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effective if the parameters of the Reed-Muller code allow for efficient sampling of minimum weight codewords. For example, the length 2048, 3rd-order Reed-Muller code as proposed in [8] takes roughly an hour to break on a stock PC using the presented method. © International Association for Cryptology Research 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Minder, L., & Shokrollahi, A. (2007). Cryptanalysis of the Sidelnikov cryptosystem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4515 LNCS, pp. 347–360). Springer Verlag. https://doi.org/10.1007/978-3-540-72540-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free