<--- Back to Details
First PageDocument Content
Cryptography / Public-key cryptography / Key management / Digital signature / Post-quantum cryptography / Key / Elliptic Curve Digital Signature Algorithm / RSA / Cryptographic hash function / Merkle signature scheme / Lamport signature
Date: 2016-04-06 13:04:46
Cryptography
Public-key cryptography
Key management
Digital signature
Post-quantum cryptography
Key
Elliptic Curve Digital Signature Algorithm
RSA
Cryptographic hash function
Merkle signature scheme
Lamport signature

State Management for Hash Based Signatures David McGrew1 , Panos Kampanakis1 , Scott Fluhrer1 , Stefan-Lukas Gazdag2 , Denis Butin3 , and Johannes Buchmann3 1 Cisco Systems, USA

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 364,82 KB

Share Document on Facebook

Similar Documents

Appears in Fast Software Encryption(FSE 2004), Lecture Notes in Computer Science, Vol. ????, Springer-Verlag. This is the full version. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for P

Appears in Fast Software Encryption(FSE 2004), Lecture Notes in Computer Science, Vol. ????, Springer-Verlag. This is the full version. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for P

DocID: 1rEjw - View Document

POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2

POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2

DocID: 1roz3 - View Document

The Politics of Cryptography: Bitcoin and The Ordering Machines

The Politics of Cryptography: Bitcoin and The Ordering Machines

DocID: 1rmtA - View Document

Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

DocID: 1rivo - View Document