Invitation to Cryptology

Name: Invitation to Cryptology
Availability: InStock
ISBN: 9780130889768

ISBN-10: 0130889768

ISBN-13: 9780130889768

Edition: 2002

Authors: Thomas Barr

List price: $146.65

This item qualifies for FREE shipping.

30 day, 100% satisfaction guarantee!

Semester Rental: $29.75 Due date: 8/13/2024

Rental notice: supplementary materials (access codes, CDs, etc.) are not guaranteed with rental orders.

Buy used: $50.70

Marketplace

2 new & used from $43.45

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

For a one-semester undergraduate-level course in Cryptology, Mathematics, or Computer Science. Designed for either the intelligent freshman (good at math) or for a low-level junior year first course, Cryptology 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 text. Unlike other texts in this field, Cryptology brings students directly to concepts of classical…

Book details

List price: $146.65
Copyright year: 2002
Publisher: Pearson Education
Publication date: 8/31/2001
Binding: Paperback
Pages: 408
Size: 6.80" wide x 9.20" long x 0.90" tall
Weight: 1.804
Language: English




Origins, Examples, and Ideas in Cryptology


A Crypto-Chronology


Cryptology and Mathematics: Functions


Crypto: Models, Maxims, and Mystique



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



Symmetric Computer-Based Cryptology


Number Representation


Boolean and Numerical Functions


Computational Complexity


Stream Ciphers and Feedback Shift Registers


Block Ciphers


Hash Functions



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



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