Practical post-quantum signature schemes from isomorphism problems of trilinear forms
From MaRDI portal
Publication:2170103
DOI10.1007/978-3-031-07082-2_21OpenAlexW4285249181MaRDI QIDQ2170103
Gang Tang, Willy Susilo, Youming Qiao, Dung Hoang Duong, Thomas Plantard, Antoine Joux
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_21
Related Items (3)
Hardness estimates of the code equivalence problem in the rank metric ⋮ Take your MEDS: digital signatures from matrix code equivalence ⋮ Graph-theoretic algorithms for the alternating trilinear form equivalence problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the generalized MinRank problem
- Some noteworthy alternating trilinear forms
- A fast isomorphism test for groups whose Lie algebra has genus 2
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Decomposing \(p\)-groups via Jordan algebras.
- The computational complexity of some problems of linear algebra
- Isomorphism testing for \(p\)-groups
- CSIDH: an efficient post-quantum commutative group action
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- He gives C-sieves on the CSIDH
- Quantum security analysis of CSIDH
- General linear group action on tensors: a candidate for post-quantum cryptography
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Practical graph isomorphism. II.
- Graphs on unlabelled nodes with a given number of edges
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Cryptographic group actions and applications
- Operating Degrees for XL vs. F4/F5 for Generic $\mathcal{M}Q$ with Number of Equations Linear in That of Variables
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Tensor rank is NP-complete
- Modular Multiplication Without Trial Division
- The Symmetric Group Defies Strong Fourier Sampling
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Cryptanalysis of MinRank
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Trilinear alternating forms on a vector space of dimension 7
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
- Quantum Computation and Lattice Problems
- Trilinear alternating forms on a vector space of dimension 8 over a finite field
- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
- Graph isomorphism in quasipolynomial time [extended abstract]
- Constructing elliptic curve isogenies in quantum subexponential time
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
- Classification of 8-Dimensional Trilinear Alternating Forms over GF(2)
- Alternating trilinear forms and groups of exponent 6
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- STACS 2005
- Asymmetric graphs
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- Limitations of quantum coset states for graph isomorphism
- On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
This page was built for publication: Practical post-quantum signature schemes from isomorphism problems of trilinear forms
