cours / présentation

2.1. Formal Definition

Welcome to the second week of this MOOC entitled Code-Based Cryptography. This week, we will talk in detail about the McEliece cryptosystem. First, in this session, we will describe formally the McEliece and the Niederreiter systems, which are the principal public-key schemes, based on error-correct...

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 : 5 minutes 35 secondes
Contenu : vidéo
Document : video/mp4
Poids : 170.23 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é

Welcome to the second week of this MOOC entitled Code-Based Cryptography. This week, we will talk in detail about the McEliece cryptosystem. First, in this session, we will describe formally the McEliece and the Niederreiter systems, which are the principal public-key schemes, based on error-correcting code. Let K be a security parameter. An encryption scheme is defined by the following spaces: the space of all possible messages, the space of all ciphertexts, the space of the public-keys, and the space of the secret-keys.Then, we need to define the following algorithms. A key generation algorithm, which is a randomized algorithm that outputs a public-key and a secret-key; this algorithm should run in expected polynomial time. An encryption algorithm, which is also a randomized algorithm that takes a message and the public-key and outputs a ciphertext; this algorithm runs also in expected polynomial time. And a decryption algorithm, which is an algorithm that takes a ciphertext and a secret-key, and outputs the original plaintext or declares a failure; this algorithm runs in polynomial time. It is required that the decryption of the ciphertext is again the plaintext, and we demand that the fasten attack on the system requires at least 2^k bit operations. In 1978, McEliece introduced the first public-key cryptosystem, as we have already seen, based on error-correcting codes. The security of this scheme is based on two intractable problems: the hardness of decoding, and the problem of distinguishing a code with a prescribed structure. This property makes this scheme an interesting candidate for post-quantum cryptography. Another advantage consists of its fast encryption and decryption algorithms. But the main drawback is the large size of the keys. We will use as public-key, a large generator matrix.

"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 : 32819
Identifiant OAI-PMH : oai:canal-u.fr:32819
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