Algebraic algorithm for the alternating trilinear form equivalence problem
From MaRDI portal
Publication:6550580
DOI10.1007/978-3-031-46495-9_5zbMATH Open1540.94074MaRDI QIDQ6550580
Simona Samardjiska, Monika Trimoska, Lars Ran
Publication date: 5 June 2024
Cites Work
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- SeaSign: compact isogeny signatures from class group actions
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Cryptographic group actions and applications
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- Cryptanalysis of MinRank
- Computing automorphism groups of error-correcting codes
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
- LESS is More: Code-Based Signatures Without Syndromes
- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
- 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
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)
