2003Unpublished venueRequires access

The Security of “One-Block-to-Many” Modes of Operation

Henri Gilbert, France Télécom R&d

Open publisher page 0 citations

Abstract

In this paper, we investigate the security, in the Luby-Rackoff secu-rity paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block output under the control of a secret key K. Such “one-block-to-many ” modes of operation are of frequent use in cryptology. They can be used for stream cipher encryption purposes, and for authentication and key distribution purposes in contexts such as mobile communications. We show that although the expansion functions resulting from modes of operation of blockciphers such as the counter mode or the output feedback mode are not pseudorandom, slight modi-fications of these two modes provide pseudorandom expansion functions. The main result of this paper is a detailed proof, in the Luby-Rackoff se-curity model, that the expansion function used in the construction of the third generation mobile (UMTS) example authentication and key agree-ment algorithm MILENAGE is pseudorandom. 1

About this research paper

What this paper is about

In this paper, we investigate the security, in the Luby-Rackoff secu-rity paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block output under the control of a secret key K. Such “one-block-to-many ” modes of operation are of frequent use in cryptology. They can be used for stream cipher encryption purposes, and for authentication and key distribution purposes in contexts such as mobile communications. We show that although the expansion functions resulting from modes of operation of blockciphers such as the counter mode or the output feedback mode are not pseudorandom, slight modi-fications of these two modes provide pseudorandom expansion functions. The main result of this paper is a detailed proof, in the Luby-Rackoff se-curity model, that the expansion function used in the construction of the third generation mobile (UMTS) example authentication and key agree-ment algorithm MILENAGE is pseudorandom. 1

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we investigate the security, in the Luby-Rackoff secu-rity paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block output under the control of a secret key K. Such “one-block-to-many ” modes of operation are of frequent use in cryptology. They can be used for stream cipher encryption purposes, and for authentication and key distribution purposes in contexts such as mobile communications. We show that although the expansion functions resulting from modes of operation of blockciphers such as the counter mode or the output feedback mode are not pseudorandom, slight modi-fications of these two modes provide pseudorandom expansion functions. The main result of this paper is a detailed proof, in the Luby-Rackoff se-curity model, that the expansion function used in the construction of the third generation mobile (UMTS) example authentication and key agree-ment algorithm MILENAGE is pseudorandom. 1

Key concepts: Computer science, Block cipher mode of operation, Pseudorandom function family, Pseudorandom number generator, CBC-MAC, Block cipher, Pseudorandom permutation, Key (lock)

Related papers

Back to paper searchBrowse research topicsOriginal source
The Security of “One-Block-to-Many” Modes of Operation — Research Paper | ScholarLens