scientific article; zbMATH DE number 1303122
From MaRDI portal
Publication:4249637
zbMath0919.94030MaRDI QIDQ4249637
Jacques Patarin, Nicolas T. Courtois, Louis Goubin
Publication date: 6 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmscomplexitiessecret keysignature schemeasymmetric authenticationasymmetric cryptographic algorithmsisomorphis of graphsisomorphisms of polynomialsmorphisms of polynomials
Related Items
Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption ⋮ A SYSTEMATIC CONSTRUCTION OF A -MODULE IN TTM ⋮ Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials ⋮ An improved affine equivalence algorithm for random permutations ⋮ On enumeration of polynomial equivalence classes ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ An algorithm for solving over-determined multivariate quadratic systems over finite fields ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ EFLASH: a new multivariate encryption scheme ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects ⋮ Key Recovery on Hidden Monomial Multivariate Schemes ⋮ Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property ⋮ Alzette: a 64-bit ARX-boxes (feat. CRAX and TRAX) ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
