Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes

Details Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes

2006-06-02

arxiv.org/abs/cs/0606011v6

Computer Science

Cryptography and Security

11 pages, new version, minor corrections

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633286