Large-scale randomization techniques

Authors:
Neal R. Wagner;Paul S. Putter;Marianne R. Cain
Affiliations:
Drexel Univ., Philadelphia, PA;The Pennsylvania State Univ., University Park;Drexel Univ., Philadelphia, PA
Venue:
Proceedings on Advances in cryptology---CRYPTO '86
Year:
1987

Citing 4
Cited 0

Random sequence generation by cellular automata

Advances in Applied Mathematics
Using algorithms as keys in stream ciphers

Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper looks at a collection of especially simple conventional cryptosystems that use a very large blocksize. One variation uses a single xor randomization followed by a single bit permutation. Tight upper and lower bounds are obtained on the number of bits of matching plaintext/ciphertext needed to break the systems. These results follow from two interesting combinatorial theorems. The cryptosystems are not practical because the number of bits above is about the same as the keysize. We can make the systems practical by introducing key-dependent pseudo-random numbers, though we then lose any proofs of the difficulty of cryptanalysis.