Pub. Date:
Springer Berlin Heidelberg
Introduction to Cryptography: Principles and Applications / Edition 2

Introduction to Cryptography: Principles and Applications / Edition 2

by Hans Delfs, Helmut Knebl


View All Available Formats & Editions
Current price is , Original price is $69.95. You
Select a Purchase Option (Softcover reprint of hardcover 2nd ed. 2007)
  • purchase options
    $47.93 $69.95 Save 31% Current price is $47.93, Original price is $69.95. You Save 31%.
  • purchase options

Product Details

ISBN-13: 9783642080401
Publisher: Springer Berlin Heidelberg
Publication date: 11/29/2010
Series: Information Security and Cryptography
Edition description: Softcover reprint of hardcover 2nd ed. 2007
Pages: 367
Sales rank: 978,834
Product dimensions: 6.10(w) x 9.25(h) x 0.03(d)

About the Author

Prof. Dr. Hans Delfs is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, database design, and software architectures.

Prof. Dr. Helmut Knebl is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, algorithms, and theoretical computer science.

Table of Contents

Introduction     1
Encryption and Secrecy     1
The Objectives of Cryptography     2
Attacks     4
Cryptographic Protocols     5
Provable Security     6
Symmetric-Key Encryption     11
Stream Ciphers     12
Block Ciphers     15
DES     16
AES     19
Modes of Operation     25
Public-Key Cryptography     33
The Concept of Public-Key Cryptography     33
Modular Arithmetic     35
The Integers     35
The Integers Modulo n     37
RSA     41
Key Generation and Encryption     41
Digital Signatures     45
Attacks Against RSA     46
Probabilistic RSA Encryption     51
Cryptographic Hash Functions     54
Security Requirements for Hash Functions     54
Construction of Hash Functions     56
Data Integrity and Message Authentication     62
Hash Functions as Random Functions     64
Signatures with Hash Functions     65
The Discrete Logarithm     70
ElGamal's Encryption     70
ElGamal's Signature Scheme     72
Digital Signature Algorithm     73
Modular Squaring     76
Rabin's Encryption     76
Rabin's Signature Scheme     77
Cryptographic Protocols     81
Key Exchange and Entity Authentication     81
Kerberos     82
Diffie-Hellman Key Agreement     85
Key Exchange and Mutual Authentication     86
Station-to-Station Protocol     88
Public-Key Management Techniques     89
Identification Schemes     91
Interactive Proof Systems     91
Simplified Fiat-Shamir Identification Scheme     93
Zero-Knowledge     95
Fiat-Shamir Identification Scheme     97
Fiat-Shamir Signature Scheme     99
Commitment Schemes     100
A Commitment Scheme Based on Quadratic Residues     101
A Commitment Scheme Based on Discrete Logarithms     102
Homomorphic Commitments     103
Electronic Elections     104
Secret Sharing     105
A Multi-Authority Election Scheme     107
Proofs of Knowledge     110
Non-Interactive Proofs of Knowledge     112
Extension to Multi-Way Elections     112
Eliminating the Trusted Center     113
Digital Cash     115
Blindly Issued Proofs     117
A Fair Electronic Cash System     123
Underlying Problems     128
Probabilistic Algorithms     135
Coin-Tossing Algorithms     135
Monte Carlo and Las Vegas Algorithms     140
One-Way Functions and the Basic Assumptions     147
A Notation for Probabilities     148
Discrete Exponential Function     149
Uniform Sampling Algorithms     155
Modular Powers     158
Modular Squaring     161
Quadratic Residuosity Property     162
Formal Definition of One-Way Functions     163
Hard-Core Predicates     167
Bit Security of One-Way Functions     175
Bit Security of the Exp Family     175
Bit Security of the RSA Family     182
Bit Security of the Square Family     190
One-Way Functions and Pseudorandomness     199
Computationally Perfect Pseudorandom Bit Generators     199
Yao's Theorem     207
Provably Secure Encryption     215
Classical Information-Theoretic Security      216
Perfect Secrecy and Probabilistic Attacks     220
Public-Key One-Time Pads     224
Passive Eavesdroppers     226
Chosen-Ciphertext Attacks     233
A Security Proof in the Random Oracle Model     236
Security Under Standard Assumptions     245
Unconditional Security of Cryptosystems     250
The Bounded Storage Model     251
The Noisy Channel Model     260
Provably Secure Digital Signatures     265
Attacks and Levels of Security     265
Claw-Free Pairs and Collision-Resistant Hash Functions     268
Authentication-Tree-Based Signatures     271
A State-Free Signature Scheme     273
Algebra and Number Theory     289
The Integers     289
Residues     295
The Chinese Remainder Theorem     299
Primitive Roots and the Discrete Logarithm     301
Polynomials and Finite Fields     304
The Ring of Polynomials     305
Residue Class Rings     307
Finite Fields     308
Quadratic Residues     310
Modular Square Roots     315
Primes and Primality Tests     319
Probabilities and Information Theory     325
Finite Probability Spaces and Random Variables     325
The Weak Law of Large Numbers     333
Distance Measures     336
Basic Concepts of Information Theory     340
References     349
Index     361

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews