Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
From MaRDI portal
Publication:2349096
DOI10.1016/j.jco.2015.04.001zbMath1338.94064arXiv1307.4974OpenAlexW3113087031MaRDI QIDQ2349096
Jean-Charles Faugère, Ludovic Perret, Jérémy Berthomieu
Publication date: 16 June 2015
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4974
Related Items
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, Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing, Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
- The complexity of computing the permanent
- Computing symmetric rank for symmetric tensors
- On representations of general linear groups over principal ideal local rings of length two.
- On enumeration of polynomial equivalence classes and their application to MPKC
- Invariance of simultaneous similarity and equivalence of matrices under extension of the ground field
- The Magma algebra system. I: The user language
- Gaussian elimination is not optimal
- Additive groups associated with points of a projective space
- Representation by quadratic forms in a finite field
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- Tight Lower Bounds for Testing Linear Isomorphism
- New Insight into the Isomorphism of Polynomial Problem IP1S and Its Use in Cryptography
- Partial Derivatives in Arithmetic Complexity and Beyond
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Equivalent keys in ℳultivariate uadratic public key systems
- A Novel Group Signature Scheme Based on MPKC
- Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
- The distribution of polynomials over finite fields, with applications to the Gowers norms
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
- Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem
- Symmetric Tensors and Symmetric Tensor Rank
- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
- Affine projections of polynomials
- Geometric complexity theory and tensor rank
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
- Structured Factorizations in Scalar Product Spaces
- Explicit lower bounds via geometric complexity theory
- Two classical theorems on commuting matrices
- Systems of distinct representatives and linear algebra
