Book contents
- Frontmatter
- Contents
- Preface
- Preface to the revised edition
- Chapter 1 Algebraic Foundations
- Chapter 2 Structure of Finite Fields
- Chapter 3 Polynomials over Finite Fields
- Chapter 4 Factorization of Polynomials
- Chapter 5 Exponential Sums
- Chapter 6 Linear Recurring Sequences
- Chapter 7 Theoretical Applications of Finite Fields
- Chapter 8 Algebraic Coding Theory
- Chapter 9 Cryptology
- Chapter 10 Tables
- Bibliography
- List of Symbols
- Index
Chapter 9 - Cryptology
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- Preface
- Preface to the revised edition
- Chapter 1 Algebraic Foundations
- Chapter 2 Structure of Finite Fields
- Chapter 3 Polynomials over Finite Fields
- Chapter 4 Factorization of Polynomials
- Chapter 5 Exponential Sums
- Chapter 6 Linear Recurring Sequences
- Chapter 7 Theoretical Applications of Finite Fields
- Chapter 8 Algebraic Coding Theory
- Chapter 9 Cryptology
- Chapter 10 Tables
- Bibliography
- List of Symbols
- Index
Summary
In this chapter we consider some aspects of cryptology that have received considerable attention over the last few years. Cryptology is concerned with the designing and the breaking of systems for the communication of secret information. Such systems are called cryptosystems or cipher systems or ciphers. The designing aspect is called cryptography, the breaking is referred to as cryptanalysis. The rapid development of computers, the electronic transmission of information, and the advent of electronic transfer of funds all contributed to the evolution of cryptology from a government monopoly that deals with military and diplomatic communications to a major concern of business. The concepts have changed from conventional (private-key) cryptosystems to public-key cryptosystems that provide privacy and authenticity in communication via transfer of messages. Cryptology as a science is in its infancy since it is still searching for appropriate criteria for security and measures of complexity of cryptosystems.
Conventional cryptosystems date back to the ancient Spartans and Romans. One elementary cipher, the Caesar cipher, was used by Julius Caesar and consists of a single key K = 3 such that a message M is transformed into M + 3 modulo 26, where the integers 0, 1, …, 25 represent the letters A, B, …, Z of the alphabet. An obvious generalization of this cipher leads to the substitution ciphers often named after de Vigenère, a French cryptographer of the 16th century.
- Type
- Chapter
- Information
- Introduction to Finite Fields and their Applications , pp. 344 - 373Publisher: Cambridge University PressPrint publication year: 1994