A CONSTRUCTION OF THE SIMPLEST SUPER PSEUDORANDOM PERMUTATION GENERATOR

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 235
  • Download : 0
In this paper, we consider one of the two open problems proposed by Pieprzyk [1], i.e., whether a permutation generator which is designed using five rounds of the Data Encryption Standard and a single pseudorandom function is a super pseudorandom permutation generator. First, we show that psi(f, f, f(2), f) is pseudorandom. Then, using the pseudorandomness of psi(f(2), f, f, f) and psi(f, f, f(2), f), we show psi(f, f(2), f, f, f) is super pseudorandom.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1995-04
Language
English
Article Type
Article
Citation

COMPUTERS MATHEMATICS WITH APPLICATIONS, v.29, no.8, pp.19 - 25

ISSN
0898-1221
URI
http://hdl.handle.net/10203/77365
Appears in Collection
CS-Journal Papers(저널논문)MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0