Invitation to Cryptology / Edition 1

Invitation to Cryptology / Edition 1

by Thomas H. Barr
     
 

ISBN-10: 0130889768

ISBN-13: 9780130889768

Pub. Date: 09/28/2001

Publisher: Pearson

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

…  See more details below

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. 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. For individuals seeking an up-close and accurate idea of how current-day cryptographic methods work.

Product Details

ISBN-13:
9780130889768
Publisher:
Pearson
Publication date:
09/28/2001
Series:
Featured Titles for Cryptography Series
Edition description:
New Edition
Pages:
396
Sales rank:
1,243,585
Product dimensions:
7.00(w) x 9.05(h) x 0.94(d)

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.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >