Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes
| dc.creator | Chen, Hao | |
| dc.creator | Ma, Liang | |
| dc.creator | Li, Jianhua | |
| dc.date | 2006-06-02 | |
| dc.date | 2006-09-19 | |
| dc.date.accessioned | 2026-07-07T08:16:35Z | |
| dc.date.available | 2026-07-07T08:16:35Z | |
| dc.description | 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. | |
| dc.description | 11 pages, new version, minor corrections | |
| dc.identifier | https://arxiv.org/abs/cs/0606011 | |
| dc.identifier | http://arxiv.org/abs/cs/0606011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133826 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Information Theory | |
| dc.title | Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes | |
| dc.type | text |