all InfoSec news
Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants
March 1, 2024, 3 a.m. |
IACR News www.iacr.org
ePrint Report: Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants
Anand Kumar Narayanan, Youming Qiao, Gang Tang
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.
We present new algorithms for MCE and …
actions algorithms code eprint report focus forms gang linear matrix problems report tang umbrella under
More from www.iacr.org / IACR News
Regev Factoring Beyond Fibonacci: Optimizing Prefactors
1 day, 9 hours ago |
www.iacr.org
NTRU-based FHE for Larger Key and Message Space
1 day, 9 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Open-Source Intelligence (OSINT) Policy Analyst (TS/SCI)
@ WWC Global | Reston, Virginia, United States
Security Architect (DevSecOps)
@ EUROPEAN DYNAMICS | Brussels, Brussels, Belgium
Infrastructure Security Architect
@ Ørsted | Kuala Lumpur, MY
Contract Penetration Tester
@ Evolve Security | United States - Remote
Senior Penetration Tester
@ DigitalOcean | Canada