Date Added: Oct 2011
The last three years have witnessed tremendous progress in the understanding of code-based cryptography. One of its most promising applications is the design of cryptographic schemes with exceptionally strong security guarantees and other desirable properties. In contrast to number-theoretic problems typically used in cryptography, the underlying problems have so far resisted sub-exponential time attacks as well as quantum algorithms. This paper will survey the more recent developments. Code-based cryptography is one of the most promising candidates for post-quantum cryptography, i.e., cryptosystems that resist attacks by quantum computers.