Introduction to cryptography : principles and applications / Hans Delfs and Helmut Knebl.

By: Delfs, H.

Contributor(s): Knebl, Helmut .

Material type: materialTypeLabel

BookSeries: Information security and cryptography.Publisher: Berlin ; New York : Springer, 2002Description: xiv, 310 p. ;c24 cm. + hbk.ISBN: 3540422781.Subject(s): Computer security

| Cryptography

| Computer networks -- Security measures

DDC classification: 005.82

Contents:

Introduction -- Symmetric-key encryption -- Public-key cryptography -- Cryptographic protocols -- Probabilistic algorithms -- One-way functions and the basic assumptions -- Bit security of one-way functions -- One-way functions and pseudorandomness -- Provably secure digital signatures.

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode	Item holds
General Lending	MTU Bishopstown Library Lending	005.82 (Browse shelf(Opens below))	1	Available		00092317

Total holds: 0

Enhanced descriptions from Syndetics:

Modern cryptography provides essential techniques for securing information and protecting data. This book provides an introduction to the key concepts of cryptography, from encryption and digital signatures to cryptographic protocols, such as electronic elections and digital cash. It applies probability theory to make basic notions precise, such as the security of cryptographic schemes. More advanced topics are also addressed, such as the bit security of one-way functions and computationally perfect pseudo-random generators. No special background in mathematics is needed to understand the material; an explanation of the necessary mathematics is given in two appendices. In addition, to make the material readily accessible, the authors use the same examples throughout the book and provide complete proofs. It will be an ideal textbook for an undergraduate course in cryptography as well as a guide to those wanting an introduction to the subject.

Includes bibliographical references (pages 297-304) and index.

Table of contents provided by Syndetics

1. Introduction (p. 1)
1.1 Encryption and Secrecy (p. 1)
1.2 The Objectives of Cryptography (p. 2)
1.3 Attacks (p. 4)
1.4 Cryptographic Protocols (p. 5)
1.5 Provable Security (p. 6)
2. Symmetric-Key Encryption (p. 11)
2.1 Stream Ciphers (p. 12)
2.2 Block Ciphers (p. 14)
2.2.1 DES (p. 15)
2.2.2 Modes of Operation (p. 18)
3. Public-Key Cryptography (p. 23)
3.1 The Concept of Public-Key Cryptography (p. 23)
3.2 Modular Arithmetic (p. 25)
3.2.1 The Integers (p. 25)
3.2.2 The Integers Modulo n (p. 27)
3.3 RSA (p. 31)
3.3.1 Key Generation and Encryption (p. 31)
3.3.2 Digital Signatures (p. 35)
3.3.3 Attacks Against RSA (p. 36)
3.3.4 The Secure Application of RSA Encryption (p. 37)
3.4 Hash Functions (p. 39)
3.4.1 Merkle's Meta Method (p. 40)
3.4.2 Construction of Hash Functions (p. 41)
3.4.3 Probabilistic Signatures (p. 43)
3.5 The Discrete Logarithm (p. 46)
3.5.1 ElGamal's Encryption (p. 47)
3.5.2 ElGamal's Signature Scheme (p. 48)
3.5.3 Digital Signature Algorithm (p. 49)
3.6 Modular Squaring (p. 52)
3.6.1 Rabin's Encryption (p. 52)
3.6.2 Rabin's Signature Scheme (p. 54)
4. Cryptographic Protocols (p. 57)
4.1 Key Exchange and Entity Authentication (p. 57)
4.1.1 Kerberos (p. 58)
4.1.2 Diffie-Hellman Key Agreement (p. 61)
4.1.3 Key Exchange and Mutual Authentication (p. 62)
4.1.4 Station-to-Station Protocol (p. 64)
4.1.5 Public-Key Management Techniques (p. 65)
4.2 Identification Schemes (p. 67)
4.2.1 Interactive Proof Systems (p. 67)
4.2.2 Simplified Fiat-Shamir Identification Scheme (p. 69)
4.2.3 Zero-Knowledge (p. 71)
4.2.4 Fiat-Shamir Identification Scheme (p. 73)
4.2.5 Fiat-Shamir Signature Scheme (p. 75)
4.3 Commitment Schemes (p. 76)
4.3.1 A Commitment Scheme Based on Quadratic Residues (p. 77)
4.3.2 A Commitment Scheme Based on Discrete Logarithms (p. 78)
4.3.3 Homomorphic Commitments (p. 79)
4.4 Electronic Elections (p. 80)
4.4.1 Secret Sharing (p. 81)
4.4.2 A Multi-Authority Election Scheme (p. 83)
4.4.3 Proofs of Knowledge (p. 86)
4.4.4 Non-Interactive Proofs of Knowledge (p. 88)
4.4.5 Extension to Multi-Way Elections (p. 88)
4.4.6 Eliminating the Trusted Center (p. 89)
4.5 Digital Cash (p. 91)
4.5.1 Blindly Issued Proofs (p. 93)
4.5.2 A Fair Electronic Cash System (p. 99)
4.5.3 Underlying Problems (p. 104)
5. Probabilistic Algorithms (p. 111)
5.1 Coin-Tossing Algorithms (p. 111)
5.2 Monte Carlo and Las Vegas Algorithms (p. 116)
6. One-Way Functions and the Basic Assumptions (p. 123)
6.1 A Notation for Probabilities (p. 124)
6.2 Discrete Exponential Function (p. 125)
6.3 Uniform Sampling Algorithms (p. 131)
6.4 Modular Powers (p. 134)
6.5 Modular Squaring (p. 137)
6.6 Quadratic Residuosity Property (p. 138)
6.7 Formal Definition of One-Way Functions (p. 139)
6.8 Hard-Core Predicates (p. 143)
7. Bit Security of One-Way Functions (p. 151)
7.1 Bit Security of the Exp Family (p. 151)
7.2 Bit Security of the RSA Family (p. 158)
7.3 Bit Security of the Square Family (p. 166)
8. One-Way Functions and Pseudorandomness (p. 175)
8.1 Computationally Perfect Pseudorandom Bit Generators (p. 175)
8.2 Yao's Theorem (p. 183)
9. Provably Secure Encryption (p. 191)
9.1 Classical Information-Theoretic Security (p. 191)
9.2 Perfect Secrecy and Probabilistic Attacks (p. 196)
9.3 Public-Key One-Time Pads (p. 199)
9.4 Computationally Secret Encryption Schemes (p. 202)
9.5 Unconditional Security of Cryptosystems (p. 208)
9.5.1 The Bounded Storage Model (p. 209)
9.5.2 The Noisy Channel Model (p. 217)
10. Provably Secure Digital Signatures (p. 221)
10.1 Attacks and Levels of Security (p. 221)
10.2 Claw-Free Pairs and Collision-Resistant Hash Functions (p. 224)
10.3 Authentication-Tree-Based Signatures (p. 227)
10.4 A State-Free Signature Scheme (p. 229)
A. Algebra and Number Theory (p. 245)
A.1 The Integers (p. 245)
A.2 Residues (p. 251)
A.3 The Chinese Remainder Theorem (p. 255)
A.4 Primitive Roots and the Discrete Logarithm (p. 257)
A.5 Quadratic Residues (p. 259)
A.6 Modular Square Roots (p. 264)
A.7 Primes and Primality Tests (p. 268)
B. Probabilities and Information Theory (p. 273)
B.1 Finite Probability Spaces and Random Variables (p. 273)
B.2 The Weak Law of Large Numbers (p. 281)
B.3 Distance Measures (p. 284)
B.4 Basic Concepts of Information Theory (p. 288)
References (p. 297)
Index (p. 305)

Introduction to cryptography : principles and applications / Hans Delfs and Helmut Knebl.

By: Delfs, H.

Contributor(s): Knebl, Helmut.

Enhanced descriptions from Syndetics:

Table of contents provided by Syndetics

Contributor(s): Knebl, Helmut .