Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects

DOI10.1007/11761679_3MaRDI QIDQ3593087zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(F_{5}\) algorithm cryptanalysis Gröbner bases isomorphism of polynomials (IP)Public-key cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

Cites work

Cited in

(28)

Solving the problem of blockwise isomorphism of polynomials with circulant matrices
Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials
Practical post-quantum signature schemes from isomorphism problems of trilinear forms
General linear group action on tensors: a candidate for post-quantum cryptography
Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
On enumeration of polynomial equivalence classes
A method for counting the number of polynomial equivalence classes
New insight into the isomorphism of polynomial problem IP1S and its use in cryptography
Cryptanalysis of the TRMS Signature Scheme of PKC’05
New Differential-Algebraic Attacks and Reparametrization of Rainbow
A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
scientific article; zbMATH DE number 1303122 (Why is no real title available?)
Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
Graph-theoretic algorithms for the ``isomorphism of polynomials problem
Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
Efficient algorithms for some special cases of the polynomial equivalence problem
Progress in Cryptology - INDOCRYPT 2003
Key Recovery on Hidden Monomial Multivariate Schemes
Implicit white-box implementations: white-boxing ARX ciphers
Hardness estimates of the code equivalence problem in the rank metric
Take your MEDS: digital signatures from matrix code equivalence
Algebraic algorithm for the alternating trilinear form equivalence problem
Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
Rare structures in tensor graphs. Bermuda triangles for cryptosystems based on the tensor isomorphism problem
On digital signatures based on group actions: QROM security and ring signatures
On enumeration of polynomial equivalence classes and their application to MPKC
On self-equivalence encodings in white-box implementations

Describes a project that uses

Uses Software

FGb

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)