Add to ORKGWe instantiate the hash-based post-quantum stateful signature schemes XMSS and its multi-tree version described in RFC 8391 and NIST SP 800-208 with SM3, and report on the results of the preliminary performance test
We present WOTS+, a Winternitz type one-time signature scheme (WOTS). We prove that WOTS+ is strongl...
Grover search algorithm accelerates the key search on the symmetric key cipher and the pre-image att...
Digital signatures are essential for the security of computer networks such as the Internet. For exa...
Quantum computing poses challenges to public key signatures as we know them today. LMS and XMSS are ...
This work introduces XMSS-T, a new stateful hash-based signature scheme with tight security. Previou...
Digital signatures are one of the most important cryptographic primitives in practice. They are an e...
This work presents a novel machine-checked tight security proof for XMSS —a stateful hash-based sign...
\u3cp\u3eWe present the hash-based signature scheme XMSS. It is the first provably (forward) secure ...
Digital signatures constructed solely from hash functions offer competitive signature sizes and fast...
Quantum computing threatens conventional public-key cryptography. In response, standards bodies such...
We introduce Multi Tree XMSS (XMSS^MT), a hash-based signature scheme that can be used to sign a vir...
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and prac...
The current Java Card platform does not seem to allow for fast implementations of hash-based signatu...
This work presents new speed records for XMSS (RFC 8391) signature verification on embedded devices....
Cryptographers and security experts around the world have been awakened to the reality that one day ...
We present WOTS+, a Winternitz type one-time signature scheme (WOTS). We prove that WOTS+ is strongl...
Grover search algorithm accelerates the key search on the symmetric key cipher and the pre-image att...
Digital signatures are essential for the security of computer networks such as the Internet. For exa...
Quantum computing poses challenges to public key signatures as we know them today. LMS and XMSS are ...
This work introduces XMSS-T, a new stateful hash-based signature scheme with tight security. Previou...
Digital signatures are one of the most important cryptographic primitives in practice. They are an e...
This work presents a novel machine-checked tight security proof for XMSS —a stateful hash-based sign...
\u3cp\u3eWe present the hash-based signature scheme XMSS. It is the first provably (forward) secure ...
Digital signatures constructed solely from hash functions offer competitive signature sizes and fast...
Quantum computing threatens conventional public-key cryptography. In response, standards bodies such...
We introduce Multi Tree XMSS (XMSS^MT), a hash-based signature scheme that can be used to sign a vir...
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and prac...
The current Java Card platform does not seem to allow for fast implementations of hash-based signatu...
This work presents new speed records for XMSS (RFC 8391) signature verification on embedded devices....
Cryptographers and security experts around the world have been awakened to the reality that one day ...
We present WOTS+, a Winternitz type one-time signature scheme (WOTS). We prove that WOTS+ is strongl...
Grover search algorithm accelerates the key search on the symmetric key cipher and the pre-image att...
Digital signatures are essential for the security of computer networks such as the Internet. For exa...