Abstract
A typical system used in cryptography is illustrated in Figure1.1,[6]. The text which is to be transmitted is first converted into a sequence of binary digits using some type of algebraic encoding. This sequence is referred to as the plaintext. The process of encryption (or enciphering) is accomplished by adding to the plaintext (mod 2) the bit sequence produced by a pseudo-random number generator. After transmitting the encrypted text, the plaintext is recovered by adding (mod 2) the same pseudo random sequence. This process of recovering the plaintext is usually called deciphering. Of course the entire procedure relies on the fact that for two binary digits a and b, addition modulo 2 (or equivalently, a binary exclusive or) has the property that a+b+b=a.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. E. Knuth, Seminumerical Algorithms. 2nd ed. Vol. 2 of The Art of Computer Programming. Reading, MA: Addison-Wesley Publishing Company, 1981.
R. Lidl and H. Niederreiter, Finite Fields, Vol. 20 Encyclopedia of Mathematics and Its Applications, Reading, MA: Addison-Wesley Publishing Company, 1983.
C. F. Martin, A Note on Linearization and Construction of Polynomial Mappings, Preprint, Department of Mathematics, Texas Tech University, Lubbock, Texas.
C. F. Martin, Local and Global Observation of Polynomial Systems Over a Finite Field, Preprint, Department of Mathematics, Texas Tech University, Lubbock, Texas.
R. J. McEliece, Finite Fields for Computer Scientists and Engineers, Norwell, MA: Kluwer Academic Publishers, 1987.
W H. Press, B. P. Flannery, S. A. Teukolsky and W. T. Vetterling, Numerical Recipes: The Art of Scientific Computing, New York: Cambridge University Press, 1986.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Birkhäuser Boston
About this chapter
Cite this chapter
Martin, C.F., Stamp, M. (1989). Constructing Polynomials over Finite Fields. In: Computation and Control. Progress in Systems and Control Theory, vol 1. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-3704-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3704-4_16
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3438-4
Online ISBN: 978-1-4612-3704-4
eBook Packages: Springer Book Archive