Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
From MaRDI portal
Publication:3593087
Recommendations
Cites work
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 3771547 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303122 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 1030996 (Why is no real title available?)
- scientific article; zbMATH DE number 2009947 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- A new efficient algorithm for computing Gröbner bases (F₄)
- A traceable block cipher
- Advances in Cryptology - CRYPTO 2003
- Attacking the Affine Parts of SFLASH
- Coding and Cryptography
- Comparison Between XL and Gröbner Basis Algorithms
- Does co-NP have short interactive proofs ?
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
Cited in
(25)- Efficient algorithms for some special cases of the polynomial equivalence problem
- Hardness estimates of the code equivalence problem in the rank metric
- On self-equivalence encodings in white-box implementations
- Cryptanalysis of the TRMS Signature Scheme of PKC’05
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
- Take your MEDS: digital signatures from matrix code equivalence
- 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
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- 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
- 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
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)
