Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes
<|reference_start|>Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes: Propagation criterion of degree $l$ and order $k$ ($PC(l)$ of order $k$) and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1, 2, 3,6, 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. In this paper, algebraic-geometric codes over $GF(2^m)$ are used to modify Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying $PC(l)$ of order $k$. The new construction is compared with previously known results.<|reference_end|>
@article{chen2006vectorial,
    title={Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes},
    author={Hao Chen, Liang Ma and Jianhua Li},
    journal={arXiv preprint arXiv:cs/0606011},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0606011},
    primaryClass={cs.CR cs.IT math.IT}
}