Book contents
- Frontmatter
- Epigraph
- Contents
- Preface
- Acknowledgments
- 1 Introduction
- 2 The integers
- 3 Cryptography based on the integer ring
- 4 Cryptography based on the discrete logarithm
- 5 Information-theoretic methods in cryptography
- 6 Block ciphers
- 7 Stream ciphers
- 8 Authentication and ownership protection
- 9 Groups, rings, and fields
- 10 Cryptography based on elliptic curves
- 11 Cryptography based on hyperelliptic curves
- 12 Cryptography based on bilinear pairings
- 13 Implementation
- 14 Cryptographic protocols for security and identification
- 15 More public-key cryptography
- References
- Index
9 - Groups, rings, and fields
Published online by Cambridge University Press: 05 April 2014
- Frontmatter
- Epigraph
- Contents
- Preface
- Acknowledgments
- 1 Introduction
- 2 The integers
- 3 Cryptography based on the integer ring
- 4 Cryptography based on the discrete logarithm
- 5 Information-theoretic methods in cryptography
- 6 Block ciphers
- 7 Stream ciphers
- 8 Authentication and ownership protection
- 9 Groups, rings, and fields
- 10 Cryptography based on elliptic curves
- 11 Cryptography based on hyperelliptic curves
- 12 Cryptography based on bilinear pairings
- 13 Implementation
- 14 Cryptographic protocols for security and identification
- 15 More public-key cryptography
- References
- Index
Summary
Several different algebraic systems will often share common structural properties. Accordingly, it is efficient and productive to gather together all algebraic systems with a similar structure, and to study them collectively as a single category. Any properties that follow directly from the common structure will hold for all algebraic systems with that same structure, and these properties can be developed and studied for a given category, and then applied to all algebraic systems in that same category.
The three most important algebraic categories are the category of groups, the category of rings, and the category of fields. We will discuss each of these in turn. Each of these algebraic categories plays a different but powerful role in the development of the subject of cryptography.
The most familiar example of a group is the set of integers Z under the usual operation of addition. The set of integers is a group with an infinite number of elements. An example of a group with a finite number of elements is the group of nonnegative integers smaller than n with addition modulo n, and denoted Zn.
The most familiar example of a ring is again the set of integers Z, but now with two operations. These are the two usual operations of addition and multiplication of integers. Many other rings are also important. Much of the mathematical structure of the ring of integers is mimicked by a similar mathematical structure within the ring of univariate polynomials over a field F.
- Type
- Chapter
- Information
- Cryptography and Secure Communication , pp. 238 - 293Publisher: Cambridge University PressPrint publication year: 2014