Vectorial resilient PC(l) of order k Boolean functions from AG-codes
From MaRDI portal
Publication:2430342
Abstract: Propagation criterion of degree and order ( of order ) 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 of order from binary linear or nonlinear codes in. In this paper, algebraic-geometric codes over are used to modify Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying of order . The new construction is compared with previously known results.
Recommendations
- On cryptographic propagation criteria for Boolean functions
- New constructions of vectorial Boolean functions with good cryptographic properties
- VECTORIAL BOOLEAN FUNCTIONS WITH GOOD CRYPTOGRAPHIC PROPERTIES
- On cryptographically secure vectorial Boolean functions
- New constructions for resilient and highly nonlinear Boolean functions
Cites work
- A construction of resilient functions with high nonlinearity
- Algebraic function fields and codes
- Cryptographically resilient functions
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- Introduction to coding theory.
- Nonlinear vector resilient functions
- On the asymptotic behaviour of some towers of function fields over finite fields
- On the propagation criterion of degree l and order k
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
- Quantum Reed-Solomon codes
- Tables of curves with many points
- Vectorial Boolean functions for cryptography
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)