Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …

Zero-knowledge proofs of knowledge are useful tools to design signature schemes. The
ongoing effort to build a quantum computer urges the cryptography community to develop …

The threat of a coming quantum computer motivates the research for new zero-knowledge
proof techniques for (or based on) post-quantum cryptographic problems. One of the few …

Code-based cryptographic schemes are highly regarded among the quantum-safe
alternatives to current standards. Yet, designing code-based signatures using traditional …

The selection of secure parameter sets requires an estimation of the attack cost to break the
respective cryptographic scheme instantiated under these parameters. The current NIST …

With the recent shift to post-quantum algorithms it becomes increasingly important to provide
precise bit-security estimates for code-based cryptography such as McEliece and quasi …

Learning parity with noise (LPN) has been widely studied and used in cryptography. It was
recently brought to new prosperity since Boyle et al.(CCS'18), putting LPN to a central role in …

Code equivalence is a well-known concept in coding theory. Recently, literature saw an
increased interest in this notion, due to the introduction of protocols based on the hardness …

The estimation of the computational complexity of hard problems is essential for determining
secure parameters for cryptographic systems. To date, those estimations are often …

We propose new time-memory trade-offs for the random subset sum problem defined on (a
1,…, an, t) over Z 2 n. Our trade-offs yield significant running time improvements for every …