cours / présentation

2.9. Implementation

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...

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 : 3 minutes 59 secondes
Contenu : vidéo
Document : video/mp4
Poids : 106.13 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 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 key cryptosystem. They mesure among other criteria: the key size, the time of the key generation algorithm, the encryption algorithm, and the decryption algorithm. The eBATS benchmarking includes seven public key encryption schemes. A McEliece implementation, from Biswas and Sendrier, using binary Goppa codes with length of 2048, and the number of errors that it can correct is 32. The security level of this scheme is around 80 bits of security. An NTRU implementation with 256-bits of security and five sizes of RSA. eBATS times each system on a wide range of computer. None of this implementation have a layer of semantic security. The results seem to confirm that the McEliece cryptosystem is an interesting candidate for public key schemes. The fastest encryption in the eBATS benchmarking is RSA, with 80 bits of security, followed by the McEliece implementation, while the fastest decryption is for NTRU, followed by the McEliece implementation. Recall that the McEliece cryptosystem is well known to provide extremely fast encryption and reasonnably fast decryption. however, the main drawback of code-based cryptography are the large key sizes. As we have seen, quasi cyclic MDPC codes allow a very compact key representation. They claim that a public key of only 4800 bits can provide a level of 80 bits security. Neither an attack nor an implementation of cryptography using quasi cyclic MDPC code have been published. We present here recent results which provide better decryption performances for the Mc Eliece. We denote by m the field extension. t, the number of errors that we can correct.

"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 : 32853
Identifiant OAI-PMH : oai:canal-u.fr:32853
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 : 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
Canal-U
Canal-U
05.05.2015
Description : In this session, we will study the notion of security of public-key scheme. A public-key scheme is one-way if the probability of success of any adversary running in polynomial time is negligible. That is, without the private key, it is computationally impossible to recover the plaintext. For the ...
  • algèbre linéaire
  • chiffrement à clé publique
  • cryptage des données
  • cryptographie
  • McEliece
  • LDPC
  • MDPC