Talk: Dr. Paolo Santini (October 11, 2022 at 2:00 PM, Seminar room N2408)
Talks |
On some batch code properties of the simplex code
Dr. Paolo Santini
Università Politecnica delle Marche
Abstract:
The Code Equivalence Problem is a rather old problem which, given a pair of linear codes, asks to find an isometry mapping one code into the other. Despite not being NP-complete, hard-to-solve instances for the problem can be easily obtained by restricting to specific codes and/or classes of isometries. The problem found recent applications in cryptography, which currently are limited to signature algorithms. Given the intrinsic difference with canonical code-based problems (such a Syndrome Decoding), using code equivalence may lead to several new constructions and functionalities. In this talk we recall the state-of-the-art in the study of code equivalence and its applications; in doing this, we also formulate some open research questions.
Biography:
Paolo Santini completed his Ph.D. in Information Engineering in 2020, under supervision of Prof. Marco Baldi at Marche Polytechnic University. He is currently working as a postdoctoral researcher in the same university. His main research interests are in cryptography and coding theory, with a special focus on post-quantum cryptography.