Using algorithms as keys in stream ciphers

Authors:
N R Wagner;P S Putter;M R Cain
Affiliations:
-;-;-
Venue:
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Year:
1986

Citing 11
Cited 1

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
Security of ramp schemes

Proceedings of CRYPTO 84 on Advances in cryptology
On the power of cascade ciphers

ACM Transactions on Computer Systems (TOCS)
On the Length of Programs for Computing Finite Binary Sequences

Journal of the ACM (JACM)
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations

Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)
On the generation of cryptographically strong pseudorandom sequences

ACM Transactions on Computer Systems (TOCS)
How to share a secret

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Large-scale randomization techniques

Proceedings on Advances in cryptology---CRYPTO '86

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the use of an arbitrary bit-sequence generating algorithm as the cryptographic key for a stream cipher. Emphasis is placed on methods for combining stream generators into more complex ones, with and without randomization. Threshold schemes give a generalization of many combination techniques.