Invitation to Cryptology - Thomas Barr

Invitation to Cryptology

(Autor)

Buch | Softcover
408 Seiten
2002
Pearson (Verlag)
978-0-13-088976-8 (ISBN)
104,75 inkl. MwSt
Introduces a range of cryptological concepts along with the mathematical ideas that are behind them. This text brings students to concepts of classical substitutions and transpositions and issues in modern cryptographic methods. It is intended for a one-semester undergraduate-level course in Cryptology, Mathematics, or Computer Science.
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.

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.

Erscheint lt. Verlag 14.2.2002
Sprache englisch
Maße 178 x 232 mm
Gewicht 660 g
Themenwelt Informatik Netzwerke Sicherheit / Firewall
Informatik Theorie / Studium Kryptologie
Mathematik / Informatik Mathematik Angewandte Mathematik
ISBN-10 0-13-088976-8 / 0130889768
ISBN-13 978-0-13-088976-8 / 9780130889768
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich

von Chaos Computer Club

Buch | Softcover (2024)
KATAPULT Verlag
28,00