Verifying Post Quantum Signatures in 8kB of RAM
In this paper, we study implementations of post-quantum signature schemes on resource-constrained devices. We focus on verification of signatures and cover NIST PQC round-3 …
ruben-gonzalez
•
•
1 min read
Practically Solving LPN
We analyse the difficulty of the LPN problem in restricted memory.
Post-Quantum TLS without handshake signatures
We present an alternative to TLS 1.3, by authenticating using only Key-Encapsulation Mechanisms. This allows us to get rid of handshake signatures, as post-quantum signature …
Peter Schwabe
Solving LPN Using Large Covering Codes
Since quantum computers are expected to break most of the cryptographic schemes we rely on today, we need to look at alternatives. Learning Parity with Noise (LPN) is mathematical …
Rephrasing TLS key exchange in terms of KEMs
In the RFC for TLS 1.3 (RFC8446) especially, the key exchange is defined in terms of (EC)DH key shares being exchanged. This limits us to algorithms which support non-interactive …
Time-invariant equality in assembly
For crypto code it's important that it's time-invariant, otherwise it is vulnerable to timing attacks. I've had to build this time-invariant equality test from scratch, because I …