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 …

Cryptography has been used from time immemorial for preserving the confidentiality of
data/information in storage or transit. Thus, cryptography research has also been evolving …

In this paper, we show how to significantly improve algebraic techniques for solving the
MinRank problem, which is ubiquitous in multivariate and rank metric code based …

We present an overview of quantum-safe cryptography (QSC) with a focus on post-quantum
cryptography (PQC) and information-theoretic security. From a cryptographic point of view …

The Rank metric decoding problem is the main problem considered in cryptography based
on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic …

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 …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

Abstract The Rank Decoding problem (RD) is at the core of rank-based cryptography.
Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST …

We introduce a new candidate post-quantum digital signature scheme from the regular
syndrome decoding (RSD) assumption, an established variant of the syndrome decoding …