Vectorial resilient PC(l) of order k Boolean functions from AG-codes

From MaRDI portal
Publication:2430342

DOI10.1007/S11401-010-0621-4zbMATH Open1210.94109arXivcs/0606011OpenAlexW1967285285MaRDI QIDQ2430342FDOQ2430342


Authors: Hao Chen, Liang Ma, Jianhua Li Edit this on Wikidata


Publication date: 6 April 2011

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Abstract: 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(2m) 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.


Full work available at URL: https://arxiv.org/abs/cs/0606011




Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: Vectorial resilient \(\mathrm{PC}(l)\) of order \(k\) Boolean functions from AG-codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430342)