Graph-theoretic algorithms for the alternating trilinear form equivalence problem

DOI10.1007/978-3-031-38548-3_4MaRDI QIDQ6145942zbMATH OpenOpenAlexFDO

Authors Ward Beullens

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38548-3_4

zbMATH Keywords

digital signature algorithmheuristic algorithms

Mathematics Subject Classification ID

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

Recommendations

• Algebraic algorithm for the alternating trilinear form equivalence problem
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
• Graph-theoretic algorithms for the ``isomorphism of polynomials problem

Cites work

• Alternating trilinear forms on a nine-dimensional space and degenerations of (3, 3)-polarized abelian surfaces
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
• Classification of 8-dimensional trilinear alternating forms over \(\mathrm{GF}(2)\)
• Classification of 9-dimensional trilinear alternating forms over \(\mathrm{GF}(2)\)
• CSI-FiSh: efficient isogeny based signatures through class group computations
• 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
• Invariant theory of \(\bigwedge^3(9)\) and genus-2 curves
• Isogeny volcanoes
• LESS is more: code-based signatures without syndromes
• Moduli of abelian varieties, Vinberg \(\theta\)-groups, and free resolutions
• 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
• 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
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Representations by skew forms in a finite field
• SeaSign: compact isogeny signatures from class group actions
• The geometry of the Coble cubic and orbital degeneracy loci

Cited in

(5)

• Algebraic algorithm 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
• On digital signatures based on group actions: QROM security and ring signatures

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Graph-theoretic algorithms 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 Q6145942)