# Cryptography Made Simple

• Nigel P. Smart
Book

Part of the Information Security and Cryptography book series (ISC)

## Table of contents

1. Front Matter
Pages i-xii
2. ### Mathematical Background

1. Front Matter
Pages 1-1
2. Nigel P. Smart
Pages 3-25
3. Nigel P. Smart
Pages 27-50
4. Nigel P. Smart
Pages 51-66
5. Nigel P. Smart
Pages 67-78
6. Nigel P. Smart
Pages 79-93
7. Nigel P. Smart
Pages 95-115
3. ### Historical Ciphers

1. Front Matter
Pages 117-117
2. Nigel P. Smart
Pages 119-132
3. Nigel P. Smart
Pages 133-161
4. Nigel P. Smart
Pages 163-177
5. Nigel P. Smart
Pages 179-194
4. ### Modern Cryptography Basics

1. Front Matter
Pages 195-195
2. Nigel P. Smart
Pages 197-223
3. Nigel P. Smart
Pages 225-240
4. Nigel P. Smart
Pages 241-269
5. Nigel P. Smart
Pages 271-294
6. Nigel P. Smart
Pages 295-311
7. Nigel P. Smart
Pages 313-347

## About this book

### Introduction

In this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout.

The chapters in Part 1 offer a brief introduction to the mathematical foundations: modular arithmetic, groups, finite fields, and probability; primality testing and factoring; discrete logarithms; elliptic curves; and lattices. Part 2 of the book shows how historical ciphers were broken, thus motivating the design of modern cryptosystems since the 1960s; this part also includes a chapter on information-theoretic security. Part 3 covers the core aspects of modern cryptography: the definition of security; modern stream ciphers; block ciphers and modes of operation; hash functions, message authentication codes, and key derivation functions; the "naive" RSA algorithm; public key encryption and signature algorithms; cryptography based on computational complexity; and certificates, key transport and key agreement. Finally, Part 4 addresses advanced prot ocols, where the parties may have different or even conflicting security goals: secret sharing schemes; commitments and oblivious transfer; zero-knowledge proofs; and secure multi-party computation.

The author balances a largely non-rigorous style — many proofs are sketched only — with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading.
This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus.

### Keywords

Block Ciphers Digital Signatures Discrete Logarithms Elliptic Curves Finite Fields Hash Functions Historical Ciphers Information-Theoretic Security Key Exchange Message Authentication Codes Primality Testing Provable Security Public-Key Cryptography Secure Multiparty Computation Stream Ciphers Symmetric-Key Cryptography The Enigma Machine

#### Authors and affiliations

• Nigel P. Smart
• 1
1. 1.Computer Science DeptUniversity of BristolBristolUnited Kingdom

### Bibliographic information

• DOI https://doi.org/10.1007/978-3-319-21936-3
• Copyright Information Springer International Publishing Switzerland 2016
• Publisher Name Springer, Cham
• eBook Packages Computer Science
• Print ISBN 978-3-319-21935-6
• Online ISBN 978-3-319-21936-3
• Series Print ISSN 1619-7100
• Series Online ISSN 2197-845X
• About this book