|
|
| |
| Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes |
| |
Citation： |
Hao CHEN,Liang MA,Jianhua LI.Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes[J].Chinese Annals of Mathematics B,2011,32(1):99~104 |
| Page view： 1610
Net amount： 1174 |
Authors： |
Hao CHEN; Liang MA; Jianhua LI; |
Foundation： |
the National Natural Science Foundation of China (No. 10871068), the joint grant
of the Danish National Research Foundation and the National Natural Science Foundation of China and
the Shanghai Leading Academic Discipline Project (No. S30504). |
|
|
| Abstract： |
Propagation criteria and resiliency of vectorial Boolean functions are important
for cryptographic purpose (see [1–4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]
gave a construction of Boolean functions satisfying PC(l) of order k from binary linear
or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to
modify the Carlet and Kurosawa-Satoh’s construction for giving vectorial resilient Boolean
functions satisfying PC(l) of order k criterion. This new construction is compared with
previously known results. |
Keywords： |
Cryptography, Boolean function, Algebraic-geometric code |
Classification： |
94B05 |
|
|
Download PDF Full-Text
|
|
|
|
