cours / présentation

5.1. Code-Based Digital Signatures

Welcome to the last week of this MOOC on code-based cryptography. This week, we will be discussing other cryptographic constructions relying on coding theory. We have seen how to do public key encryption and now we will see other kind of constructions. This first sequence we'll be having a look at d...

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 33 secondes
Contenu : vidéo
Document : video/mp4
Poids : 115.010 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 last week of this MOOC on code-based cryptography. This week, we will be discussing other cryptographic constructions relying on coding theory. We have seen how to do public key encryption and now we will see other kind of constructions. This first sequence we'll be having a look at digital signatures and how to design code-based digital signatures. So, what is digital signature? A digital signature is meant to replace a paper signature on a digital document. Exactly like a paper signature, only one person should be able to create a digital signature which ties the identity of the signer to the document. And like a normal signature, everyone should be able to verify that the signature is correct and so repudiation is impossible. This is kind of the opposite of what we do with an encryption operation in a public key cryptosystem where everyone can encrypt and only one person can decrypt. That is why most digital signatures use a decryption operation in the process. So, how do we implement a digital signature? The first operation is usually to hash the document into something of fixed size which is a ciphertext. Why do we do this? For two reasons: one is that we want to be able to sign documents of arbitrary length, which means that we need, at some point, to go from a large document to a small ciphertext. And then, we want to tie the hash ciphertext to the document. So, we need something which is a one way, for which it is difficult to build collisions and everything which is exactly the properties of hash function. Once we have this hash in the ciphertext space, we simply decrypt it. This operation requires the knowledge of the secret key as you have seen in the previous sessions. And that is why only the legitimate signer can perform this operation and can compute the signature. Once you have this signature in the plaintext space, you simply append it to the document and that is it. For the verification, the verifier just does the opposite operation: first, takes the signature outside of the document, encrypts it using the public key which is something that everyone can do.

"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 : 32959
Identifiant OAI-PMH : oai:canal-u.fr:32959
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, I am going to present the Courtois-Finiasz-Sendrier Construction of a code-based digital signature. In the previous session, we have seen that it is impossible to hash a document into decodable syndromes. But it is possible to hash onto the space of all syndromes. The document is ...
  • algèbre linéaire
  • chiffrement à clé publique
  • cryptage des données
  • cryptographie
  • code correcteur
  • algorithmes
  • CFS
  • Courtois-Finiasz-Sendrier
Canal-U
Canal-U
05.05.2015
Description : In the last session of this week, we will have a look at the FSB Hash Function which is built using the one-way function we saw in the previous session. What are the requirements for a cryptographic hash function? So, it is a function which takes an input of arbitrary size and outputs a fixed si ...
  • algèbre linéaire
  • chiffrement à clé publique
  • cryptage des données
  • cryptographie
  • code correcteur
  • algorithmes
  • CFS
  • Courtois-Finiasz-Sendrier