Verónica Requena

On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound

In 2002, in two independent papers, Bellare, Kohno, and Namprempre and Joux, Martinet, and Valette introduced the notion of blockwise security for modes of operations. This notion stems from common practice, since in many applications, modes of operation for block ciphers do not process messages as atomic entities but in a incremental manner, block after block. Soon afterward, several papers showed that many modes of operation are already blockwise secure and that others can be made secure by simple modifications. In this paper, we revisit these results, by comparing possible attacks on modes of operation after the birthday bound is reached. Amusingly, in spite having essentially identical security proofs up to this bound, modes of operation in the blockwise model behave very differently than their counterparts in the regular model, once the birthday paradox bound is crossed.In 2002, in two independent papers, Bellare, Kohno, and Namprempre and Joux, Martinet, and Valette introduced the notion of blockwise security for modes of operations. This notion stems from common practice, since in many applications, modes of operation for block ciphers do not process messages as atomic entities but in a incremental manner, block after block. Soon afterward, several papers showed that many modes of operation are already blockwise secure and that others can be made secure by simple modifications. In this paper, we revisit these results, by comparing possible attacks on modes of operation after the birthday bound is reached. Amusingly, in spite having essentially identical security proofs up to this bound, modes of operation in the blockwise model behave very differently than their counterparts in the regular model, once the birthday paradox bound is crossed.

On the construction of bent functions of

In this paper we present a method to construct iteratively new bent functions of

n+2

n + 2

variables from bent functions of

variables from bent functions of

n

n

variables

variables using minterms of

Computing the degree of a Boolean function from its support

n

A Construction of Bent Functions of Variables from a Bent Function of Variables and Its Cyclic Shifts

variables and minterms of two variables. Also, we provide the number of bent functions of

A Construction Of MDS Array Codes

n+2

The degree of a Boolean function and some algebraic properties of its support

variables that we can obtain with the method here presented.