Shoufan, Abdulhadi ; Huber, Nico ; Molter, Gregor (2011)
A Novel Cryptoprocessor Architecture for Chained Merkle Signature Scheme.
In: Microprocessors and Microsystems, Embedded Hardware Design, Elsevier, 35 (1)
doi: 10.1016/j.micpro.2010.07.002
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
One-time signature schemes rely on hash functions and are, therefore, assumed to be resistant to attacks by quantum computers. These approaches inherently raise a key management problem, as the key pair can be used only for one message. That means, for one-time signature schemes to work, the sender must deliver the veri�cation key together with the message and the signature. Upon reception, the receiver has to verify the authenticity of the veri�cation key before verifying the signature itself. Hash-tree based solutions tackle this problem by basing the authenticity of a large number of veri�cation keys on the authenticity of a root key. This approach, however, causes computation, communication, and storage overhead. Due to hardware acceleration, this paper proposes, for the �rst time, a processor architecture which boosts the performance of a one-time signature scheme without degrading memory usage and communication properties...
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2011 |
| Autor(en): | Shoufan, Abdulhadi ; Huber, Nico ; Molter, Gregor |
| Art des Eintrags: | Bibliographie |
| Titel: | A Novel Cryptoprocessor Architecture for Chained Merkle Signature Scheme |
| Sprache: | Deutsch |
| Publikationsjahr: | 2011 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Microprocessors and Microsystems, Embedded Hardware Design, Elsevier |
| Jahrgang/Volume einer Zeitschrift: | 35 |
| (Heft-)Nummer: | 1 |
| DOI: | 10.1016/j.micpro.2010.07.002 |
| Kurzbeschreibung (Abstract): | One-time signature schemes rely on hash functions and are, therefore, assumed to be resistant to attacks by quantum computers. These approaches inherently raise a key management problem, as the key pair can be used only for one message. That means, for one-time signature schemes to work, the sender must deliver the veri�cation key together with the message and the signature. Upon reception, the receiver has to verify the authenticity of the veri�cation key before verifying the signature itself. Hash-tree based solutions tackle this problem by basing the authenticity of a large number of veri�cation keys on the authenticity of a root key. This approach, however, causes computation, communication, and storage overhead. Due to hardware acceleration, this paper proposes, for the �rst time, a processor architecture which boosts the performance of a one-time signature scheme without degrading memory usage and communication properties... |
| Freie Schlagworte: | Secure Things;chained merkle signature scheme, cryptography hardware and implementation, cryptoprocessor, fpga, winternitz one-time signature |
| Fachbereich(e)/-gebiet(e): | LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt |
| Hinterlegungsdatum: | 31 Dez 2016 00:15 |
| Letzte Änderung: | 16 Okt 2020 10:18 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum