Seminar in Coding Theory and Cryptography
Seminar in Coding Theory and Cryptography
-
From Abhinaba Mazumder
In lattice-based cryptography, one of the most popular approaches to increase efficiency is to attach structures to lattices. These structures usually come from… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
Planar functions are functions defined over finite fields of odd characteristics such that their (nonzero) derivatives are permutations. They have connections with… -
From Abhinaba Mazumder
Code-based cryptography is an area of post-quantum cryptography. Several code-based candidates compete in the standardization process of the National Institute of… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
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… -
From Abhinaba Mazumder
We provide a concise introduction to CSS and CSS-T codes from the perspective of classical coding theory. We demonstrate that pairs of linear codes that yield a CSS… -
From Abhinaba Mazumder
There exist Singleton-like upper bounds for the column distances of convolutional codes, which can be reached if the underlying finite field is sufficiently large.… -
From Abhinaba Mazumder
This talk looks at linear systems under attack from an adversary. Such cyber attacks cause malfunctioning and damage and there is an increasing need for automated… -
From Abhinaba Mazumder
In the last few decades, Lee-metric codes gained a lot of attention especially with their promising application to code-based cryptography as well as their… -
From Abhinaba Mazumder
In our globalised and digitalised world, fast and error-free communication is very important. To ensure this, we use error-correcting codes which should always be… -
From Abhinaba Mazumder
In this talk, we discuss coding schemes for data storage systems, including flash memories, racetrack memories, and DNA-based systems. In particular, we present…