Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai  Home/Search
Context Related
| monash.edu.au/~yuliang/...ec89fnl.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: monash.edu.au/~yuliang/pubs/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Yuliang Zheng, Tsutomu Matsumoto and Hideki Imai Division of Electrical and Computer Engineering Yokohama National University 156 Tokiwadai, Hodogaya, Yokohama, 240 Japan Summary Let I n = f0; 1g n , and H n be the set of all functions from I n to I n . For f 2 H n , define the DES-like transformation associated with f by F 2n;f (L; R) = (R \Phi f(L); L), where L; R 2 I n . For f 1 ; f 2 ; : : : ; f s 2 H n , define /(f s ; : : : ; f 2 ; f 1 ) = F 2n;f s ffi \Delta \Delta \Delta ffi F... (Update)
Similar documents based on text: More All
1.0: Impossibility and Optimality Results on Constructing.. - Zheng, Matsumoto, Imai (1990) (Correct)
0.8: Duality between Two Cryptographic Primitives - Zheng, Matsumoto, Imai (1990) (Correct)
0.8: Structural Properties of One-Way Hash Functions - Zheng, Matsumoto, Imai (1990) (Correct)
Related documents from co-citation: More All
16: How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1984
14: How to construct pseudorandom permutations from single pseudorandom functions (context) - Pieprzyk - 1990
11: How to generate cryptographically strong sequences of pseudorandom bits (context) - Blum, Micali - 1984
BibTeX entry: (Update)
Y. Zheng, T. Matsumoto and H. Imai, "Impossibility and optimality results on constructing pseudorandom permutations." Advances in Cryptology -- Crypto 90 Proceedings, Lecture Notes in Computer Science Vol. 537, A. J. Menezes and S. Vanstone ed., Springer-Verlag, 1990, pp. 412-422. http://citeseer.ist.psu.edu/zheng89impossibility.html More
@inproceedings{ zheng89impossibility,
author = "Yuliang Zheng and Tsutomu Matsumoto and Hideki Imai",
title = "Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract)",
booktitle = "Theory and Application of Cryptographic Techniques",
pages = "412-422",
year = "1989",
url = "citeseer.ist.psu.edu/zheng89impossibility.html" }
Citations (may not include all citations):419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
339 Theory and applications of trapdoor functions (context) - Yao - 1982
39 Federal Information Processing Standards (context) - Standard - 1977
34 Some cryptographic techniques for machine-to-machine data co.. (context) - Feistel, Notz et al. - 1975
20 the construction of random number generators and random func.. (context) - Schnorr - 1988
12 A study on data security (context) - Ohnishi - 1988
10 the security of Schnorr's pseudorandom generator (context) - Rueppel - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pscit-www.fcit.monash.edu.au/~yuliang/pubs/): More
Enhancing Security in GSM - Duraiappan, Zheng (Correct)
Connections among Several Versions of One-Way Hash Functions - Zheng, Matsumoto, Imai (1990) (Correct)
The Nonhomomorphicity of Boolean Functions - Zhang, Zheng (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC