Sieve method for polynomial linear equivalence
Summary: We consider the polynomial linear equivalence (PLE) problem arising from the multivariate public key cryptography, which is defined as to find an invertible linear transformation \(\mathcal L\) satisfying \(\mathcal P=\mathcal S\circ\mathcal L\) for given nonlinear polynomial maps \(\mathcal P\) and \(\mathcal S\) over a finite field \(\mathbb F_q\). Some cryptographic and algebraic properties of PLE are discussed, and from the properties we derive three sieves called multiplicative, differential, and additive sieves. By combining the three sieves, we propose a sieve method for the PLE problem. As an application of our sieve method, we show that it is infeasible to construct public key encryption schemes from the PLE problem.
- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem
- Progress in Cryptology - INDOCRYPT 2003
- Efficient algorithms for some special cases of the polynomial equivalence problem
- A method for counting the number of polynomial equivalence classes
- On enumeration of polynomial equivalence classes
This page was built for publication: Sieve method for polynomial linear equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791367)
