Seminar in Coding Theory and Cryptography
Seminar in Coding Theory and Cryptography
-
Data centres are one of the backbones of modern-day digital infrastructure, with the amount of processed and stored data growing year by year. In this context,…
Andrea Di Giusto: The Service Rate Problem in…
0 Wiedergaben 0 -
This talk introduces a novel IND-CCA2 Key EncapsulationMechanism (KEM) based on the weighted subset sum problem. The cryptosystem uses a decoding algorithm inspired…
Francisco Javier Lobillo Borrero: A Hybrid…
0 Wiedergaben 0 -
The talk focuses on the integration of composite DNA alphabets and rank modulation, two promising paradigms for high-density DNA-based data storage. Composite DNA…
Tomer Cohen: Rank Modulated Composite Encoding…
2 Wiedergaben 0 -
The abstract can be found here.
Luca Giuzzi: Codes from Incidence Geometries
3 Wiedergaben 0 -
The sum-rank metric, which generalizes both the Hamming and rank metric, first appeared in 2005 in the context of space-time codes and later in 2010 for multi-shot …
Cornelia Ott: Bounds on Codes in the Sum-Rank…
7 Wiedergaben 0 -
The Schwartz-Zippel Lemma is a fundamental tool, that provides a bound on the size of the zero set of multivariate polynomials.In this talk we present a classical proof…
Constantinos Vasilios Argyris Vlachos: The…
6 Wiedergaben 0 -
Multivariate signature schemes are interesting for use cases where post-quantum security and short signatures are required. Currently, the most relevant multivariate…
Juliane Krämer: On the Physical Security of…
3 Wiedergaben 0 -
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…
Alejandro Giangreco: Cyclicity of the Group of…
6 Wiedergaben 0 -
Minimal codewords of a linear code reveal its important structural properties and are required, for instance, in secret-sharing schemes and certain decoding algorithms.…
Rati Ludhani: Minimal Codewords of Projective…
6 Wiedergaben 0 -
Ferrers diagram rank-metric codes were first studied in 2009 by Etzion and Silberstein, motivated by their application in network coding. Concretely, they arise from…
Alessandro Neri: Ferrers Diagram Rank-Metric Codes
2 Wiedergaben 0 -
Gianira Alfarano: The Geometry of One-Weight… 11 of 42
Gianira Alfarano: The Geometry of One-Weight…
A one-weight code, or constant-weight code, is an error-correcting code in which all codewords share the same weight. In 1984, Bonisoli provided a classification of…Gianira Alfarano: The Geometry of One-Weight…
7 Wiedergaben 0 -
In lattice-based cryptography, one of the most popular approaches to increase efficiency is to attach structures to lattices. These structures usually come from…
Samed Düzlü: Automorphic Forms and…
26 Wiedergaben 0 -
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…
Andrea Basso: SQIsign: New Trends and a Complete…
11 Wiedergaben 0 -
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…
Andrea Di Giusto: To Generalized Weights... and…
5 Wiedergaben 0 -
Please find the abstract here.
Hassan Ou-azzou: Equivalence of Polycyclic and…
3 Wiedergaben 0 -
View the abstract of the talk here.
Hassan Ou-azzou: Equivalence of Classes of…
14 Wiedergaben 0 -
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…
Luana Kurmann: Cayley Graphs with Large Girth and…
24 Wiedergaben 0 -
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…
Blerim Alimehaj: b-Symbol Weight Distribution of…
8 Wiedergaben 0 -
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…
Jung Kyu Canci: Arithmetic of Dynamical Systems…
6 Wiedergaben 0 -
Planar functions are functions defined over finite fields of odd characteristics such that their (nonzero) derivatives are permutations. They have connections with…
Irene Villa: Classification of Planar Functions
2 Wiedergaben 0 -
Code-based cryptography is an area of post-quantum cryptography. Several code-based candidates compete in the standardization process of the National Institute of…
Niklas Gassner: Codes over Rings, their Generic…
42 Wiedergaben 0 -
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…
Giulia Gaggero: MinRank Problem - Support Minors…
9 Wiedergaben 0 -
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…
Altan Kilic: Exploring the Service Rate Problem…
9 Wiedergaben 0 -
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…
Michael Schaller: BIKE and its Relation to…
14 Wiedergaben 0 -
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…
Alessio Caminata: Some Density Results on CSS and…
6 Wiedergaben 0 -
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.…
Julia Lieb: On a class of convolutional codes…
20 Wiedergaben 0 -
Jens Kopp's masters thesis defense.
Jens Kopp: Code-Based Cryptography and Algebraic…
14 Wiedergaben 0 -
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…
Margreta Kuijper: Linear System Detection and…
4 Wiedergaben 0 -
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…
Jessica Bariffi: Analysis and Decoding of Linear…
13 Wiedergaben 0 -
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…
Mario Jung: Construction of Linear Codes using…
9 Wiedergaben 0 -
In this talk, we discuss coding schemes for data storage systems, including flash memories, racetrack memories, and DNA-based systems. In particular, we present…
Khu Vu Van: Coding for Data Storage Systems
8 Wiedergaben 0 -
Code-based cryptosystems are promising candidates for post-quantum cryptography, such as the McEliece and Niederreiter cryptosystems. Their security is based on…
Vivien Bammert: Security of Algebraic Geomtry…
9 Wiedergaben 0 -
In recent years, DNA-based storage systems have emerged as promising solutions for long-term data archival due to their high data density and durability. This talk…
Daniella Bar-Lev: The DNA Storage Channel- From…
21 Wiedergaben 0 -
In this talk we generalize the concept of error sets beyond those defined by a metric and use the set-theoretic difference operator to characterize when these…
Felice Manganiello: Generic Error SDP and Generic…
3 Wiedergaben 0 -
Isogenies are rational maps between elliptic curves that are also group morphisms with respect to the group structure of the elliptic curves. The kernel of an…
Boris Fouotsa: Isogeny Representations and Their…
3 Wiedergaben 0 -
McEliece-like cryptosystems, which are at the core of code-based cryptography, exploit that efficient decoding of a suitable known code is easy but decoding in a…
Felicitas Hörmann: Distinguisher-Based…
3 Wiedergaben 0 -
A familiar object in isogeny based cryptography is the graph whose vertices are supersingular elliptic curves and whose edges are isogenies of fixed degree l. It…
Guido Maria Lido: Isogeny Graphs with Level…
2 Wiedergaben 0 -
Group actions are fundamental mathematical tools, both for classical cryptography with discrete logarithm and for post-quantum cryptography, such as isogeny-based…
Giacomo Borin: Additional Functionalities for…
1 Wiedergaben 0 -
The design of secure post-quantum digital signatures is a particularly important and current topic, especially considering the presence of initiatives such as…
Edoardo Persichetti: On Practical Post-Quantum…
5 Wiedergaben 0 -
In the last decade, Locally Recoverable Codes (LRC) have been a critical topic in communication and distributed storage. In addition, the minimum distance, dimension and…
Benjamin Jany: Bounds and Field Size of Locally…
5 Wiedergaben 0 -
Convolutional codes are a class of codes particularly well-suited for data transmission over erasure channels, commonly used in multimedia traffic over the internet.…
Yves Krähenbühl: Overview of Classes of…
3 Wiedergaben 0 -
The search for strong security and effective algorithms is never-ending in the field of modern cryptosystems. Cryptography is the foundation of trust in the digital era,…
Tatjana Bossalini : The ROCA Vulnerability- A…
12 Wiedergaben 0
Suchen nach""