Analysis of a public key approach based on polynomial substitution
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
CRYPTO '89 Proceedings on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Secrecy, authentication, and public key systems.
Secrecy, authentication, and public key systems.
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Merkle Tree Traversal Revisited
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
RECONFIG '08 Proceedings of the 2008 International Conference on Reconfigurable Computing and FPGAs
High Performance Implementation of a Public Key Block Cipher - MQQ, for FPGA Platforms
RECONFIG '08 Proceedings of the 2008 International Conference on Reconfigurable Computing and FPGAs
Fast multivariate signature generation in hardware: The case of rainbow
ASAP '08 Proceedings of the 2008 International Conference on Application-Specific Systems, Architectures and Processors
A Novel Processor Architecture for McEliece Cryptosystem and FPGA Platforms
ASAP '09 Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
CMSS: an improved merkle signature scheme
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Hi-index | 0.00 |
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 verification key together with the message and the signature. Upon reception, the receiver has to verify the authenticity of the verification key before verifying the signature itself. Hash-tree based solutions tackle this problem by basing the authenticity of a large number of verification 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 first time, a processor architecture which boosts the performance of a one-time signature scheme without degrading memory usage and communication properties. This architecture realizes the chained Merkle signature scheme on the basis of Winternitz one-time signature scheme. All operations, i.e., key generation, signing, and verification are implemented on an FPGA platform, which acts as a coprocessor. Timing measurements on the prototype show a performance boost of at least one order of magnitude compared to an identical software solution.