Abstract
In recent years considerable interest has been shown in the generation of binary sequences which have good randomness properties. Such sequences play an important role in cipher systems. In many situations the enciphering process begins with the conversion of the plaintext into string of bits by means of a binary “alphabet”. The sequence is then added to the plaintext bit by bit, using modulo 2 arithmetic and the resulting ciphertext is then transmitted. Decipherment is accomplished simply by adding the sequence to the ciphertext it a similar manner.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jennings, S.M. (1983). Multiplexed Sequences: Some Properties of the Minimum Polynomial. In: Beth, T. (eds) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39466-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-39466-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11993-7
Online ISBN: 978-3-540-39466-2
eBook Packages: Springer Book Archive