General linear group action on tensors: a candidate for post-quantum cryptography
From MaRDI portal
Publication:2175914
DOI10.1007/978-3-030-36030-6_11zbMath1447.94047arXiv1906.04330OpenAlexW2990887602MaRDI QIDQ2175914
Fang Song, Aaram Yun, Zhengfeng Ji, Youming Qiao
Publication date: 30 April 2020
Full work available at URL: https://arxiv.org/abs/1906.04330
Related Items (10)
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ A lower bound on the length of signatures based on group actions and generic isogenies ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments ⋮ Two remarks on the vectorization problem ⋮ Cryptographic group actions and applications ⋮ Oblivious pseudorandom functions from isogenies ⋮ Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
Cites Work
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- On the maximal subgroups of the finite classical groups
- Testing isomorphism of modules.
- Decomposing \(p\)-groups via Jordan algebras.
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- The computational complexity of some problems of linear algebra
- Isomorphism testing for \(p\)-groups
- Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
- Wildness for tensors
- Computational problems in supersingular elliptic curve isogenies
- General linear group action on tensors: a candidate for post-quantum cryptography
- An exponential lower bound for the degrees of invariants of cubic forms and tensor actions
- Algorithms for orbit closure separation for invariants and semi-invariants of matrices
- SeaSign: compact isogeny signatures from class group actions
- The distinction between fixed and random generators in group-based assumptions
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Post-quantum security of Fiat-Shamir
- Practical graph isomorphism. II.
- Geometric complexity theory V: Efficient algorithms for Noether normalization
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- New Insight into the Isomorphism of Polynomial Problem IP1S and Its Use in Cryptography
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Isomorphism in expanding families of indistinguishable groups
- Quantum algorithms for algebraic problems
- Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
- Number-theoretic constructions of efficient pseudo-random functions
- Tensor rank is NP-complete
- Public Key Identification Based on the Equivalence of Quadratic Forms
- Post-Quantum Cryptography
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- Random Graph Isomorphism
- Computing automorphism groups of error-correcting codes
- A classification of irreducible prehomogeneous vector spaces and their relative invariants
- Geometric Invariant Theory
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Is code equivalence easy to decide?
- 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
- Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time.
- Quantum Computation and Lattice Problems
- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
- The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
- Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
- Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
- Polynomial-time theory of matrix groups
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks
- Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
- Graph isomorphism in quasipolynomial time [extended abstract]
- On the Lattice Isomorphism Problem
- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
- Deterministic Polynomial Time Algorithms for Matrix Completion Problems
- Most Tensor Problems Are NP-Hard
- Constructing elliptic curve isogenies in quantum subexponential time
- Number of Points of Varieties in Finite Fields
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Limitations of quantum coset states for graph isomorphism
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: General linear group action on tensors: a candidate for post-quantum cryptography
