Journal of Applied Mathematics
- J. Appl. Math.
- Volume 2013 (2013), Article ID 872962, 8 pages.
Sieve Method for Polynomial Linear Equivalence
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 satisfying for given nonlinear polynomial maps and over a finite field . 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.
J. Appl. Math., Volume 2013 (2013), Article ID 872962, 8 pages.
First available in Project Euclid: 14 March 2014
Permanent link to this document
Digital Object Identifier
Zentralblatt MATH identifier
Wang, Baocang; Hu, Yupu. Sieve Method for Polynomial Linear Equivalence. J. Appl. Math. 2013 (2013), Article ID 872962, 8 pages. doi:10.1155/2013/872962. https://projecteuclid.org/euclid.jam/1394808286