Two papers at PKC 2016

We got two papers (on hash-based signatures!) into this years PKC! One is on an implementation of SPHINCS on an ARM Cortex M3. While the result is surely no practical implementation (the signatures are simply too big) it shows that it is in general doable. Besides, we give a comparison with XMSS on the same platform. The result shows that if you are able to allow for a state, you can get away with a pretty efficient implementation.

The other paper started as a security analysis of our recent Internet-Draft. On the way, we figured we had to analyse what we call multi-target security properties for hash functions under generic quantum attacks. In this context we present new matching lower and upper bounds on the quantum query complexity against such properties (incl. traditional one-wayness, second-preimage resistance and extended target-collision resistance).

%d bloggers like this: