A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem

DOI10.1007/11426639_21MaRDI QIDQ5385739zbMATH OpenOpenAlexFDO

Authors Ludovic Perret

Publication date 6 May 2008

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

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

zbMATH Keywords

CryptanalysisIsomorphism of Polynomials with One Secret (IP1S)Jacobian MatrixPolynomial Linear Equivalence (PLE)

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Progress in Cryptology - INDOCRYPT 2003
• New insight into the isomorphism of polynomial problem IP1S and its use in cryptography
• scientific article; zbMATH DE number 1303122
• Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials

Cited in

(15)

• Sieve method for polynomial linear equivalence
• 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
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
• Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
• 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
• Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
• Hardness estimates of the code equivalence problem in the rank metric
• Algebraic algorithm for the alternating trilinear form equivalence problem
• Rare structures in tensor graphs. Bermuda triangles for cryptosystems based on the tensor isomorphism problem

This page was built for publication: A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem

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