Post Quantum Cryptography Code Based Hash by Gauthier Umaña (3 results)
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 43.33
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 40.50
£ 60.42 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Post-Quantum Cryptography | Code-based Cryptography and Hash Based Signatures Schemes | Valérie Gauthier Umaña | Taschenbuch | 200 S. | Englisch | 2014 | Scholars' Press | EAN 9783639715507 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]aka…demikerverlag[dot]de | Anbieter: preigu.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 46.69
£ 53.15 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. 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 a…nd 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).
