Invitation to Cryptology
List price: $117.80
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
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 substitutions and transpositions and issues in modern cryptographic methods.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $117.80
Copyright year: 2002
Publisher: Prentice Hall PTR
Publication date: 8/31/2001
Size: 7.00" wide x 9.00" long x 0.75" tall
|Origins, Examples, and Ideas in Cryptology|
|Cryptology and Mathematics: Functions|
|Crypto: Models, Maxims, and Mystique|
|Classical Cryptographic Techniques|
|Shift Ciphers and Modular Arithmetic|
|More Modular Arithmetic|
|Probability and Expectation|
|The Friedman and Kasiski Tests|
|Cryptanalysis of the Vingenere Cipher|
|The Hill Cipher|
|Symmetric Computer-Based Cryptology|
|Boolean and Numerical Functions|
|Stream Ciphers and Feedback Shift Registers|
|Primes, Factorization, and the Euclidean Algorithm|
|The Merkle-Hellman Knapsack|
|Fermat's Little Theorem|
|The RSA Public-Key Cryptosystem|
|Zero-Knowledge Identification Protocols|
|Case Studies and Issues|
|Case Study I: DES|
|Case Study II: PGP|
|Law and Issues Regarding Cryptography|
|Table of Primes|
|Answers to Selected Exercises|