1993Unpublished venueRequires access

A Single Pseudorandom Function

Babak Sadeghiym, Josef Pieprzyk

Open publisher page 1 citations

Abstract

In this paper, we show how to construct a super pseudorandom permutation generator from a single pseudorandom function generator, based on DES-like permutations. First, we show +(g, l,f,g, 1, f), whidi consists of six rounda of DES-like permutations with two different pseudorandom functions and a fixed permutation, is super psuedorandom. Then, we show that with replacing a twcdold composition of one of the pseudorandom functions instead of the other one it is possible to construct a super pseudorandom permutation from a single pseudorandom function, where we need six rounds of DES-like permutations and six references to the pseudorandom function.

About this research paper

What this paper is about

In this paper, we show how to construct a super pseudorandom permutation generator from a single pseudorandom function generator, based on DES-like permutations. First, we show +(g, l,f,g, 1, f), whidi consists of six rounda of DES-like permutations with two different pseudorandom functions and a fixed permutation, is super psuedorandom. Then, we show that with replacing a twcdold composition of one of the pseudorandom functions instead of the other one it is possible to construct a super pseudorandom permutation from a single pseudorandom function, where we need six rounds of DES-like permutations and six references to the pseudorandom function.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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 show how to construct a super pseudorandom permutation generator from a single pseudorandom function generator, based on DES-like permutations. First, we show +(g, l,f,g, 1, f), whidi consists of six rounda of DES-like permutations with two different pseudorandom functions and a fixed permutation, is super psuedorandom. Then, we show that with replacing a twcdold composition of one of the pseudorandom functions instead of the other one it is possible to construct a super pseudorandom permutation from a single pseudorandom function, where we need six rounds of DES-like permutations and six references to the pseudorandom function.

Key concepts: Pseudorandom number generator, Pseudorandom permutation, Pseudorandom generator, Pseudorandom generator theorem, Pseudorandom function family, Pseudorandomness, Permutation (music), Random permutation

Related papers

Back to paper searchBrowse research topicsOriginal source
A Single Pseudorandom Function — Research Paper | ScholarLens