Post-Quantum Cryptography : Code-based Cryptography and Hash Based Signatures Schemes

Valérie Gauthier Umaña

ISBN 10: 3639715500 / ISBN 13: 9783639715507

Edité par Scholars' Press, 2014

A propos de cet article

nach der Bestellung gedruckt Neuware - Printed after ordering - Quantum computers will break the security of almost all the public-key cryptosystems used in practice. This book focus on two classes of cryptography that can resist these emerging attacks. In the first part, we introduce coding theory and give an overview of code-based cryptography. The main contribution is an attack on two promising cryptosystem (joint work with Gregor Leander). We also present a deterministic polynomial-time algorithm to solve the Goppa Code Distinguisher problem for high rate codes (joint work with Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret and Jean-Pierre Tillich). In the second part, we give an overview of hash based signature schemes that are a good quantum resistant alternative to the used signature schemes. We propose a new variant of the classical one-time signature schemes based on (near-)collisions resulting in two-time signature schemes and give a new, simple and efficient algorithm for traversing a tree in tree-based signature schemes (joint work with Lars Knudsen and Søren Thomsen).

N° de réf. du vendeur 9783639715507

Détails bibliographiques

• Titre: Post-Quantum Cryptography : Code-based Cryptography and Hash Based Signatures Schemes
• Éditeur: Scholars' Press
• Date de parution: 2014
• Langue: anglais
• ISBN à 10 chiffres: 3639715500
• ISBN à 13 chiffres: 9783639715507
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 220 L x 150 H x 13 P (en millimètres) 220 millimètres de largeur par 150 millimètres de hauteur par 13 millimètres de profondeur
• Poids: 316 grammes

A propos de ce titre

Synopsis

Quantum computers will break the security of almost all the public-key cryptosystems used in practice. This book focus on two classes of cryptography that can resist these emerging attacks. In the first part, we introduce coding theory and give an overview of code-based cryptography. The main contribution is an attack on two promising cryptosystem (joint work with Gregor Leander). We also present a deterministic polynomial-time algorithm to solve the Goppa Code Distinguisher problem for high rate codes (joint work with Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret and Jean-Pierre Tillich). In the second part, we give an overview of hash based signature schemes that are a good quantum resistant alternative to the used signature schemes. We propose a new variant of the classical one-time signature schemes based on (near-)collisions resulting in two-time signature schemes and give a new, simple and efficient algorithm for traversing a tree in tree-based signature schemes (joint work with Lars Knudsen and Søren Thomsen).