Algebraic algorithm for the alternating trilinear form equivalence problem

DOI10.1007/978-3-031-46495-9_5MaRDI QIDQ6550580zbMATH OpenFDO

Authors Lars Ran, Simona Samardjiska, Monika Trimoska

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/978-3-031-46495-9_5

zbMATH Keywords

algebraic cryptanalysismatrix codestrilinear form

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Graph-theoretic algorithms for the alternating trilinear form equivalence problem
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
• scientific article; zbMATH DE number 2070405
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)

Cites work

• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
• A new efficient algorithm for computing Gröbner bases (F₄)
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
• Computing automorphism groups of error-correcting codes
• Cryptanalysis of MinRank
• Cryptographic group actions and applications
• Graph-theoretic algorithms for the ``isomorphism of polynomials problem
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• LESS is more: code-based signatures without syndromes
• Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• On the computational hardness of the code equivalence problem in cryptography
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• SeaSign: compact isogeny signatures from class group actions
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• The Magma algebra system. I: The user language

Cited in

(4)

• Graph-theoretic algorithms for the alternating trilinear form equivalence problem
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Highway to Hull: an algorithm for solving the general matrix code equivalence problem
• Rare structures in tensor graphs. Bermuda triangles for cryptosystems based on the tensor isomorphism problem

This page was built for publication: Algebraic algorithm for the alternating trilinear form equivalence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550580)