Youming Qiao

Feb 29, 2024 | eprint.iacr.org | Anand Narayanan |Youming Qiao |Gang Tang

Paper 2024/368 , SandboxAQ, University of Technology Sydney, University of Technology Sydney, University of Birmingham We devise algorithms for finding equivalences of trilinear forms over finite fields modulo linear group actions. Our focus is on two problems under this umbrella, Matrix Code Equivalence (MCE) and Alternating Trilinear Form Equivalence (ATFE), since their hardness is the foundation of the NIST round-$1$ signature candidates MEDS and ALTEQ respectively.

Jun 28, 2023 | arxiv.org | Youming Qiao

[Submitted on 28 Jun 2023 (v1), last revised 12 Apr 2024 (this version, v2)] Title:On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications View a PDF of the paper titled On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications, by Joshua A.