Chapter 8. Math with AES and Elliptic Curves

Introduction

We’ve seen a plethora of techniques for performing secret key and public key cryptography, and the number theory behind some of the public key algorithms. These public key schemes are based on the difficulty of factoring large integers, or the difficulty of calculating discrete logarithms over Zp*. While these problems still seem intractable, some significant progress has been made, and that makes cryptographers nervous.

So cryptographers have started exploiting somewhat different mathematical structures to use as the basis for cryptographic schemes. In this chapter we’ll explore the mathematics needed to properly understand Rijndael/AES (described algorithmically in §3.5 Advanced Encryption ...

Get Network Security: Private Communication in a Public World, Second Edition now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.