cours / présentation

2.8. Reducing the Key Size - MDPC codes

This is the last session where we will talk about reducing the key size. Here we will introduce the MDPC codes. In 2012, the MDPC codes were proposed for the McEliece schemes. An MDPC code is a code that admits a binary moderate density-parity check matrix. Typically, the Hamming weight of each row...

Date de création :

05.05.2015

Auteur(s) :

Irene MARQUEZ-CORBELLA, Nicolas SENDRIER, Matthieu FINIASZ

Présentation

Informations pratiques

Langue du document : Anglais
Type : cours / présentation
Niveau : master, doctorat
Durée d'exécution : 4 minutes 55 secondes
Contenu : vidéo
Document : video/mp4
Poids : 132.310 Mo
Droits d'auteur : libre de droits, gratuit
Droits réservés à l'éditeur et aux auteurs. Ces ressources de cours sont, sauf mention contraire, diffusées sous Licence Creative Commons. L’utilisateur doit mentionner le nom de l’auteur, il peut exploiter l’œuvre sauf dans un contexte commercial et il ne peut apporter de modifications à l’œuvre originale.

Description de la ressource

Résumé

This is the last session where we will talk about reducing the key size. Here we will introduce the MDPC codes. In 2012, the MDPC codes were proposed for the McEliece schemes. An MDPC code is a code that admits a binary moderate density-parity check matrix. Typically, the Hamming weight of each row is of the order the square of the length. In this sequence, I will describe this scheme of quasi-cyclic MDPC McEliece for a binary code of rate one half. So, we use circulant matrices of blocks of size p to define the codes. The length will be 2p and the dimension p. Other parameters are the weight of the parity check equations and the number of correctable errors. So, let us explain the McEliece schemes using quasi-cyclic MDPC code. First of all, we pick randomly two vectors of weight p, such that the concatenated vector has a weight smaller than w. We will repeat until the corresponding polynomial h0 is invertible. In particular, we ask the weight to be odd. Then, the secret key and the public key will be the corresponding matrices. To encrypt a message, we apply the following function, that is, we encode the message and we add random errors of weight smaller than t. But we will describe them in terms of polynomial. To decrypt, we use an MDPC-like iterative decoding algorithm as the Gallager's Bit-Flipping algorithm, already explained in the previous session. The quasi-cyclic MDPC proposal is secure under two assumptions. First of all, the problem of distinguishing a public key from a random quasi-cyclic matrix or equivalently the problem of finding codewords of weight w in the dual of an MDCP code; and the hardness of decoding random quasi-cyclic codes. The security reduction can be translated in terms of polynomials as follows.

"Domaine(s)" et indice(s) Dewey

  • Analyse numérique (518)
  • Théorie de l'information (003.54)
  • données dans les systèmes informatiques (005.7)
  • cryptographie (652.8)
  • Mathématiques (510)

Domaine(s)

  • Analyse numérique
  • Analyse numérique appliquée, calcul numérique, mathématiques numériques
  • Programmation : Algorithmique, langages, conception objet, programmes
  • Informatique
  • Informatique
  • Expression orale et écrite
  • Cryptographie
  • Généralités, philosophie, théorie des mathématiques
  • Généralités
  • Outils, méthodes et techniques scientifiques
  • Didactique des mathématiques
  • Histoire des mathématiques
  • Mathématiques et physique

Document(s) annexe(s)

Fiche technique

Identifiant de la fiche : 32849
Identifiant OAI-PMH : oai:canal-u.fr:32849
Schéma de la métadonnée : oai:uved:Cemagref-Marine-Protected-Areas
Entrepôt d'origine : Canal-U

Voir aussi

Canal-U
Canal-U
05.05.2015
Description : This is the last session of the second week. The cryptography community has different options for using public key cryptosystems, among others, they have RSA or DSA. But … McEliece has the same level of performance of the current protocol? eBATS is a competition to identify the most efficient public ...
  • algèbre linéaire
  • chiffrement à clé publique
  • cryptage des données
  • cryptographie
  • McEliece
  • LDPC
  • MDPC
Canal-U
Canal-U
05.05.2015
Description : In this session, we will talk about McEliece assumptions. The security of the McEliece scheme is based on two assumptions as we have already seen: the hardness of decoding a random linear code and the problem of distinguishing a code with a prescribed structure from a random one. In this sequence, ...
  • algèbre linéaire
  • chiffrement à clé publique
  • cryptage des données
  • cryptographie
  • McEliece
  • LDPC
  • MDPC