Sieve Method for Polynomial Linear Equivalence
Joint Authors
Source
Journal of Applied Mathematics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-12-10
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Wang, Baocang& Hu, Yupu. 2013. Sieve Method for Polynomial Linear Equivalence. Journal of Applied Mathematics،Vol. 2013, no. 2013, pp.1-8.
https://search.emarefa.net/detail/BIM-505160
Modern Language Association (MLA)
Wang, Baocang& Hu, Yupu. Sieve Method for Polynomial Linear Equivalence. Journal of Applied Mathematics No. 2013 (2013), pp.1-8.
https://search.emarefa.net/detail/BIM-505160
American Medical Association (AMA)
Wang, Baocang& Hu, Yupu. Sieve Method for Polynomial Linear Equivalence. Journal of Applied Mathematics. 2013. Vol. 2013, no. 2013, pp.1-8.
https://search.emarefa.net/detail/BIM-505160
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-505160