Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
From MaRDI portal
Publication:3593087
DOI10.1007/11761679_3zbMATH Open1140.94337OpenAlexW1806793453MaRDI QIDQ3593087FDOQ3593087
Authors: Jean-Charles Faugère, Ludovic Perret 
Publication date: 24 September 2007
Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11761679_3
Recommendations
Cites Work
- Title not available (Why is that?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Does co-NP have short interactive proofs ?
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparison Between XL and Gröbner Basis Algorithms
- Title not available (Why is that?)
- A traceable block cipher
- Coding and Cryptography
- Attacking the Affine Parts of SFLASH
Cited In (25)
- Cryptanalysis of the TRMS Signature Scheme of PKC’05
- On self-equivalence encodings in white-box implementations
- Take your MEDS: digital signatures from matrix code equivalence
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
- Progress in Cryptology - INDOCRYPT 2003
- Graph-theoretic algorithms for the ``isomorphism of polynomials problem
- Solving the problem of blockwise isomorphism of polynomials with circulant matrices
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
- Implicit white-box implementations: white-boxing ARX ciphers
- New Differential-Algebraic Attacks and Reparametrization of Rainbow
- On enumeration of polynomial equivalence classes
- Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials
- Key Recovery on Hidden Monomial Multivariate Schemes
- New insight into the isomorphism of polynomial problem IP1S and its use in cryptography
- On enumeration of polynomial equivalence classes and their application to MPKC
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- General linear group action on tensors: a candidate for post-quantum cryptography
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
- A method for counting the number of polynomial equivalence classes
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
- Algebraic algorithm for the alternating trilinear form equivalence problem
- Efficient algorithms for some special cases of the polynomial equivalence problem
- Hardness estimates of the code equivalence problem in the rank metric
Uses Software
This page was built for publication: Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593087)
