Jeudi 18 avril 2024, 14:00 à 15:00

Salle de séminaire du département informatique

Mohammed-Amhed Saeed

(Université de Khartoum, Soudan)

Code equivalence problem plays an important role in coding theory and code-based cryptography.
That is due to its significance in classification of codes and also construction and cryptanalysis of code-based cryptosystems. 
Recently National Institute of Standards and Technology (NIST) has made a call to standardize Post Quantum Cryptography.
In respond to this call many cryptographic schemes that rely on Code Equivalence Problem were proposed.
The problem of Code Equivalence is also related to the long standing problem of graph isomorphism, a well-known problem in the world of complexity theory. 
We look at this problem from algebraic prospective.