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

DOI10.1007/11426639_21zbMath1137.94354OpenAlexW1584538091MaRDI QIDQ5385739

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

CryptanalysisJacobian MatrixIsomorphism of Polynomials with One Secret (IP1S)Polynomial Linear Equivalence (PLE)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

On enumeration of polynomial equivalence classes ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ 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

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