Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants

DOI10.1007/978-3-031-58734-4_6MaRDI QIDQ6637328

Gang Tang, Anand Kumar Narayanan, Youming Qiao

Publication date: 13 November 2024

zbMATH Keywords

matrix code equivalencealternating trilinear form equivalencebirthday-type algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• Claw finding algorithms using quantum walk
• The Magma algebra system. I: The user language
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• General linear group action on tensors: a candidate for post-quantum cryptography
• On the complexity of ``Superdetermined minrank instances
• Stein's method and the rank distribution of random matrices over finite fields
• On the hitting times of quantum versus random walks
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• Cryptographic group actions and applications
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Computing automorphism groups of error-correcting codes
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
• LESS is More: Code-Based Signatures Without Syndromes
• Canonical form for graphs in quasipolynomial time: preliminary report
• Graph isomorphism in quasipolynomial time [extended abstract]
• Quantum Walk Algorithm for Element Distinctness
• Quantum cryptanalysis of hash and claw-free functions
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
• Take your MEDS: digital signatures from matrix code equivalence
• Graph-theoretic algorithms for the alternating trilinear form equivalence problem
• Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms

Related Items (1)

Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme

This page was built for publication: Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants