The decoding problem is fundamental in post-quantum cryptography. It can be broadly described as essentially solving a linear system with a non-linear constraint on the solution. Phrased this way, the problem applies to both code-based and lattice-based cryptography. For example,
Bien que certains cryptosystèmes classiques soient considérés comme sûrs avec la technologie actuelle, les avancées en informatique quantique pourraient bientôt remettre en cause la robustesse de certains mécanismes cryptographiques. À titre d’exemple, les algorithmes quantiques de factorisation des nombres premiers
Recent years have witnessed a significant development for functional encryption (FE) in the multi-user setting, particularly with multi-client functional encryption (MCFE). The challenge becomes more important when combined with access control, such as attribute-based encryption (ABE), which was actually not
The matrix code equivalence problem consists, given two k-dimensional vector spaces C,D of m x n matrices over a finite field, in finding invertible matrices P and Q such that D=PCQ. Recent signature schemes such as MEDS and ALTEQ relate
In this talk, we introduce a new NP-complete variant of the multivariate quadratic problem. The computational challenge involves finding a solution to an algebraic system that meets the "regular" constraint, meaning that each block of the solution vector contains only