A simple unpredictable pseudo random number generator
SIAM Journal on Computing
How to construct pseudo-random permutations from pseudo-random functions
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Ciphers with Arbitrary Finite Domains
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Fast Generation of Random Permutations via Networks Simulation
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
KFC - The Krazy Feistel Cipher
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
QUAD: a practical stream cipher with provable security
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Algebraic and Slide Attacks on KeeLoq
Fast Software Encryption
Enlisting ISPs to Improve Online Privacy: IP Address Mixing by Default
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
| Hi-index | 0.00 |
Existing symmetric encryption algorithms target messages consisting of elementary binary blocks of at least 64 bits. Some applications need a block cipher which operates over smaller and possibly nonbinary blocks, which can be viewed as a pseudo-random permutation of n elements. We present an algorithm for selecting such a random permutation of n elements and evaluating efficiently the permutation and its inverse over arbitrary inputs. We use an underlying deterministic RNG (random number generator). Each evaluation of the permutation uses O(log n) space and O((log n)3) RNG invocations. The selection process is "perfect": the permutation is uniformly selected among the n! possibilities.