Publication

Cryptanalysis of the Sidelnikov cryptosystem

Mohammad Amin Shokrollahi, Lorenz Minder
2007
Conference Papers

Abstract

We present a structural attack against the Sidelnikov cryptosystem. The attack creats a private key from a give public key. Its running time is subexponential and it 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 takes roughly an hour to break on a stock PC using the presented metho.

Official source

https://infoscience.epfl.ch/entities/publication/44ce7e08-9948-470a-bcdc-b1ddc5549651

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Cryptanalysis of the Sidelnikov cryptosystem

Chat with Graph Search

Secure and Efficient Cryptographic Algorithms in a Quantum World

An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation

On the Theory and Practice of Modern Secure Messaging