Open Access
2013 Sieve Method for Polynomial Linear Equivalence
Baocang Wang, Yupu Hu
J. Appl. Math. 2013: 1-8 (2013). DOI: 10.1155/2013/872962


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 𝔽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.


Download Citation

Baocang Wang. Yupu Hu. "Sieve Method for Polynomial Linear Equivalence." J. Appl. Math. 2013 1 - 8, 2013.


Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 1270.16008
Digital Object Identifier: 10.1155/2013/872962

Rights: Copyright © 2013 Hindawi

Vol.2013 • 2013
Back to Top