This is a pet peeve of many cryptographers. A cipher (like AES) hides meaning. A code (like a Hamming code) fights errors. This book treats both with equal respect. You will learn why a noisy channel is mathematically equivalent to an adversarial one, and how redundancy is a form of secret.
By working through this Universitext volume, you stop being a passive user of these technologies and start being someone who can explain the magic.
At the heart of this field lie the properties of integers. Key concepts such as the Euclidean Algorithm Greatest Common Divisors (GCD) Fundamental Theorem of Arithmetic
The study of elementary number theory, cryptography, and codes is an active area of research, with many open problems and new applications emerging. Some potential future directions include:
The book is structured as a three-act play, where each act builds upon the last, moving from pure theory to practical engineering.
This is a pet peeve of many cryptographers. A cipher (like AES) hides meaning. A code (like a Hamming code) fights errors. This book treats both with equal respect. You will learn why a noisy channel is mathematically equivalent to an adversarial one, and how redundancy is a form of secret.
By working through this Universitext volume, you stop being a passive user of these technologies and start being someone who can explain the magic.
At the heart of this field lie the properties of integers. Key concepts such as the Euclidean Algorithm Greatest Common Divisors (GCD) Fundamental Theorem of Arithmetic
The study of elementary number theory, cryptography, and codes is an active area of research, with many open problems and new applications emerging. Some potential future directions include:
The book is structured as a three-act play, where each act builds upon the last, moving from pure theory to practical engineering.
