Search for tag: "cryptography"

Multivariate signature schemes are interesting for use cases where post-quantum security and short signatures are required. Currently, the most relevant multivariate signature schemes are UOV - which…

Vladuts characterized in 1999 the set of finite fields k such that all elliptic curves defined over k have a cyclic group of rational points. Under the conjecture of infinitely many Mersenne primes,…

Minimal codewords of a linear code reveal its important structural properties and are required, for instance, in secret-sharing schemes and certain decoding algorithms. A nonzero codeword is said to…

In lattice-based cryptography, one of the most popular approaches to increase efficiency is to attach structures to lattices. These structures usually come from algebraic number theory: For…

SQIsign is the leading digital signature protocol based on isogenies and the only isogeny-based construction in the NIST standardisation process. In this talk, we introduce the SQIsign protocol,…

Generalized Hamming Weights (GHW) have seen a big rise in popularity since Victor Wei described their many properties in 1991, linking them to code performance on the wire-tap channel of type 2.…

Please find the abstract here.

View the abstract of the talk here.

In this talk, we investigate a particular family of graphs with large girth and look at their applications to low-density parity-check (LDPC) codes. Specifically, we study a family of Cayley…

As our technology advances, the need for b-symbol read channels that can handle messages with high-density data becomes crucial. The problem with conventional read channels is that they are more…

In my previous research, during my PhD and several years as a postdoc, I studied endomorphisms of the projective line. More specifically, I focused on rational functions that can be represented…

Planar functions are functions defined over finite fields of odd characteristics such that their (nonzero) derivatives are permutations. They have connections with various areas of mathematics with…

Code-based cryptography is an area of post-quantum cryptography. Several code-based candidates compete in the standardization process of the National Institute of Standards and Technology. A common…

The MinRank Problem is the computational problem of finding a low rank linear combination of a set of matrices. There are several cryptographic attacks that can be reduced to MinRank. During this…

We investigate the properties of a family of polytopes that naturally arise in connection with a problem in distributed data storage, namely service rate region polytopes. We make use of polytope…

In this talk we study the BIKE cryptosystem. We will introduce a lattice over a polynomial ring which we construct from the public key. The private key is a vector in this lattice with special…