Vectorial Boolean Functions for Cryptography

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Издательство Cambridge University Press, 2010, -93 pp.
This chapter deals with multi-output Boolean functions viewed from a cryptographic viewpoint, that is, functions from the vectorspace Fn2, of all binary vectors of length n, to the vectorspace Fm2, for some positive integers n and m, where F2 is the finite field with two elements. Obviously, these functions include the (single-output) Boolean functions which correspond to the case m=1.
When the numbers m and n are not specied, (n;m)-functions are called multi-output Boolean functions, vectorial Boolean functions or S-boxes (this last term is the most often used in cryptography, but is dedicated to the vectorial functions whose role is to provide confusion into the system; see the subsection on the cryptographic criteria for Boolean functions in the chapter Boolean Functions for Cryptography and Error Correcting Codes" for the meaning of this term).
Introduction
Generalities on vectorial Boolean functions
Highly nonlinear vectorial Boolean functions
Resilient vectorial Boolean functions

Author(s): Carlet C.

Language: English
Commentary: 620856
Tags: Информатика и вычислительная техника;Информационная безопасность;Криптология и криптография;Криптографические методы и средства ЗИ