Nouveaux protocoles et nouvelles attaques pour la cryptologie basée sur les codes en métrique rang

Abstract : Security of public keys cryptography is based on difficult mathematic problems, especially in number field theory, such as the factorization for RSA or the discrete logarithm for ElGamal. However, algorithms are more and more efficient to solve these problems. Furthermore, quantum computers would be able to easily break these cryptosystems. Code-based cryptography in rank metric is a solid candidate to design new postquatum cryptosystems since it is fast and has low weight keysize. The goals of this thesis are to study hard problems in rank metric and algorithms which solve them, also to search for new attacks and new primitives based on these problems.
Document type :
Theses
Complete list of metadatas

Cited literature [86 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01704790
Contributor : Abes Star <>
Submitted on : Thursday, February 8, 2018 - 5:31:06 PM
Last modification on : Tuesday, October 9, 2018 - 1:09:29 AM
Long-term archiving on : Saturday, May 5, 2018 - 3:07:30 AM

File

2017LIMO0088.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01704790, version 1

Collections

Citation

Adrien Hauteville. Nouveaux protocoles et nouvelles attaques pour la cryptologie basée sur les codes en métrique rang. Cryptographie et sécurité [cs.CR]. Université de Limoges, 2017. Français. ⟨NNT : 2017LIMO0088⟩. ⟨tel-01704790⟩

Share

Metrics

Record views

284

Files downloads

237