scientific article; zbMATH DE number 1303122

zbMATH Open0919.94030MaRDI QIDQ4249637FDOQ4249637

Authors: Jacques Patarin, Louis Goubin, Nicolas Courtois 

Publication date: 6 September 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

algorithmssecret keysignature schemecomplexitiesasymmetric authenticationasymmetric cryptographic algorithmsisomorphis of graphsisomorphisms of polynomialsmorphisms of polynomials

Mathematics Subject Classification ID

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

Cited In (25)

• Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
• Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
• An improved affine equivalence algorithm for random permutations
• Graph-theoretic algorithms for the ``isomorphism of polynomials problem
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
• Solving the problem of blockwise isomorphism of polynomials with circulant matrices
• On enumeration of polynomial equivalence classes
• An algorithm for solving over-determined multivariate quadratic systems over finite fields
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials
• Algorithms based on \(\ast\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
• Key Recovery on Hidden Monomial Multivariate Schemes
• New insight into the isomorphism of polynomial problem IP1S and its use in cryptography
• Probabilistic hash-and-sign with retry in the quantum random oracle model
• A SYSTEMATIC CONSTRUCTION OF A -MODULE IN TTM
• On enumeration of polynomial equivalence classes and their application to MPKC
• General linear group action on tensors: a candidate for post-quantum cryptography
• Alzette: a 64-bit ARX-boxes (feat. CRAX and TRAX)
• 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
• Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• EFLASH: a new multivariate encryption scheme
• Hardness estimates of the code equivalence problem in the rank metric

This page was built for publication:

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