text.skipToContent text.skipToNavigation

Privacy and Cookies

We use cookies to give you the best experience on our website. By continuing, you're agreeing to use of cookies. We have recently updated our policy.

  1. Home
  2. Computer Science & IT
  3. Advanced Math
  4. Additional Advanced Math
  5. Invitation to Cryptology

Invitation to Cryptology, 1st edition

  • Thomas H. Barr

Published by Pearson (August 31st 2001) - Copyright © 2002

1st edition

Unfortunately, this item is not available in your country.

Overview

This book introduces a wide range of up-to-date cryptological concepts along with the mathematical ideas that are behind them. The new and old are organized around a historical framework. A variety of mathematical topics that are germane to cryptology (e.g., modular arithmetic, Boolean functions, complexity theory, etc.) are developed, but they do not overshadow the main focus of the book. KEY TOPICS: Chapter topics cover origins, examples, and ideas in cryptology; classical cryptographic techniques; symmetric computer-based cryptology; public-key cryptography; and present practice, issues, and the future. MARKET: For individuals seeking an up-close and accurate idea of how current-day cryptographic methods work.

Table of contents



1. Origins, Examples, and Ideas in Cryptology.

A Crypto-Chronology. Cryptology and Mathematics: Functions. Crypto: Models, Maxims, and Mystique.


2. Classical Cryptographic Techniques.

Shift Ciphers and Modular Arithmetic. Affine Ciphers; More Modular Arithmetic. Substitution Ciphers. Transposition Ciphers. Polyalphabetic Substitutions. Probability and Expectation. The Friedman and Kasiski Tests. Cryptanalysis of the Vingenere Cipher. The Hill Cipher; Matrices.


3. Symmetric Computer-Based Cryptology.

Number Representation. Boolean and Numerical Functions. Computational Complexity. Stream Ciphers and Feedback Shift Registers. Block Ciphers. Hash Functions.


4. Public-Key Cryptography.

Primes, Factorization, and the Euclidean Algorithm. The Merkle-Hellman Knapsack. Fermat's Little Theorem. The RSA Public-Key Cryptosystem. Key Agreement. Digital Signatures. Zero-Knowledge Identification Protocols.


5. Case Studies and Issues.

Case Study I: DES. Case Study II: PGP. Public-Key Infrastructure. Law and Issues Regarding Cryptography.


Glossary.


Bibliography.


Table of Primes.


Answers to Selected Exercises.


Index.

For teachers

All the material you need to teach your courses.

Discover teaching material