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 …