Skip to Main content Skip to Navigation
Theses

Testeurs, problemes de reconstruction univaries et multivaries, et application a la cryptanalyse du DES.

Cédric Tavernier 1
1 CODES - Coding and cryptography
Inria Paris-Rocquencourt
Abstract : We studied the decoding problem of Reed-Muller codes of order r in different kinds of chanels and in different context. For us the noisy code word of Reed-Muller code is simply a boolean function. A natural question is to know if there exists or not at least one code word of the Reed-Muller code of order r which is at given dis-tance d of our noisy code word. So we studied the testing problem and generalysed some known checkers to the characteristic 2. In order to produce cryptographic attack, we constructed some adaptative decoding algorithms for Reed-Muller codes of order 1 and 2 in large length. An important applicative part is hallowed to the study of the statistic properties of DES cryptosystem. Then we did a digression about the construction of modular curves.
Document type :
Theses
Complete list of metadatas

https://pastel.archives-ouvertes.fr/pastel-00000711
Contributor : Ecole Polytechnique <>
Submitted on : Wednesday, July 21, 2010 - 10:18:09 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Friday, October 22, 2010 - 3:35:12 PM

Identifiers

  • HAL Id : pastel-00000711, version 1

Collections

Citation

Cédric Tavernier. Testeurs, problemes de reconstruction univaries et multivaries, et application a la cryptanalyse du DES.. Informatique [cs]. Ecole Polytechnique X, 2004. Français. ⟨pastel-00000711⟩

Share

Metrics

Record views

305

Files downloads

231