Public key cryptography is a major interdisciplinary subject with many real-world
applications, such as digital signatures. A strong background in the mathematics underlying …

Decoding random linear codes is a well studied problem with many applications in
complexity theory and cryptography. The security of almost all coding and LPN/LWE-based …

Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …

We propose a new decoding algorithm for random binary linear codes. The so-called
information set decoding algorithm of Prange (1962) achieves worst-case complexity 2 …

Decoding random linear codes is a fundamental problem in complexity theory and lies at the
heart of almost all code-based cryptography. The best attacks on the most prominent code …

Although they have been studied for a long time, distributed signature protocols have
garnered renewed interest in recent years in view of novel applications to topics like …

Although it is one of the most popular signature schemes today, ECDSA presents a number
of implementation pitfalls, in particular due to the very sensitive nature of the random value …

Proof-of-work is a central concept in modern cryptocurrencies and denial-ofservice
protection tools, but the requirement for fast verification so far has made it an easy prey for …

We present a new variant of cube attacks called a dynamic cube attack. Whereas standard
cube attacks [4] find the key by solving a system of linear equations in the key bits, the new …

The security of code-based cryptosystems such as the McEliece cryptosystem relies
primarily on the difficulty of decoding random linear codes. The best decoding algorithms …