Improved algorithms for isomorphisms of polynomials

DOI10.1007/BFB0054126MaRDI QIDQ4249637zbMATH OpenFDO

Authors Jacques Patarin, Louis Goubin, Nicolas Courtois

Publication date 6 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0054126

zbMATH Keywords

algorithmsasymmetric authenticationasymmetric cryptographic algorithmscomplexitiesisomorphis of graphsisomorphisms of polynomialsmorphisms of polynomialssecret keysignature scheme

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Cryptography (94A60)

Recommendations

• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• Progress in Cryptology - INDOCRYPT 2003
• Graph-theoretic algorithms for the ``isomorphism of polynomials problem
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem

Cited in

(25)

• An improved affine equivalence algorithm for random permutations
• EFLASH: a new multivariate encryption scheme
• Alzette: a 64-bit ARX-boxes (feat. CRAX and TRAX)
• 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
• 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
• 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
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• A SYSTEMATIC CONSTRUCTION OF A -MODULE IN TTM
• Algorithms based on -algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
• 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
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
• Key Recovery on Hidden Monomial Multivariate Schemes
• An algorithm for solving over-determined multivariate quadratic systems over finite fields
• Hardness estimates of the code equivalence problem in the rank metric
• Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
• Probabilistic hash-and-sign with retry in the quantum random oracle model
• On enumeration of polynomial equivalence classes and their application to MPKC

This page was built for publication: Improved algorithms for isomorphisms of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249637)