Text

Introduction to cryptography

---

Anak judul: principles and applications.
Termasuk bibliografi dan indeks.

Guide to elliptic curve cryptography / Darrel Hankerson, Scott Vanstone, Alfred J. Menezes.
Computer security.
Public key cryptography.
ContentsList of Algorithms List of Tables List of Figures Acronyms




CONTENTS:
1. Introduction

< >1.1 Encryption and Secrecy

< >1.2 The Objectives of Cryptography

< >1.3 Attacks

< >1.4 Cryptographic Protocols

< >1.5 Provable Security

2. Symmetric-Key Encryption

< >2.1 Stream Ciphers

< >2.2 Block Ciphers

< >< >2.2.1 DES

< >< >2.2.2 AES

< >< >2.2.3 M odes of Operation

3. Public-Key Cryptography

< >3.1 The Concept of Public-Key Cryptography

< >3.2 Modular Arithmetic

< >< >3.2.1 The Integers

< >< >3.2.2 The Integers Modulo n

< >3.3 RSA

< >< >3.3.1 Key Generation and Encryption

< >< >3.3.2 Digital Signatures

< >< >3.3.3 Attacks Against RSA

< >< >3.3.4 Probabilistic RSA Encryption

< >3.4 Cryptographic Hash Functions

< >< >3.4.1 Security Requirenients for Hash Functions

< >< >3.4.2 Construction of Hash Functions

< >< >3.4.3 Data Integrity and Message Authentication

< >< >3.4.1 Hash Functions as Random Functions

< >< >3.4.5 Signatures with Hash Functions

< >3.5 The Discrete Logarithm

< >< >3.5.1 E Gamrnal's Encryption

< >< >3.5.2 E1Gamal's Signature Scheme

< >< >3.5.3 Digital Signature Algorithm

< >3.6 M odular Squaring

< >< >3.6.1 Rabin's Encryption

< >< >3.6.2 Rabin's Signature Scheme

4. Cryptographic Protocols

< >4.1 Key Exchange and Entity Authentication

< >< >4.1.1 Kerberos

< >< >4.1.2 Diffie-Hellman Key Agreement

< >< >4.1.3 Key Exchange and Mutual Authentication

< >< >4.1.4 Station-to-Station Protocol

< >< >4.1.5 Public-Key Management Techniques

< >4.2 Identification Schem es

< >< >4.2.1 Interactive Proof Systems

< >< >4.2.2 Simplified Fiat-Shamir Identification Scheme

< >< >4.2.3 Zero-Knowledge

< >< >1.2.4 Fiat-Shamir Identification Scheme

< >< >4.2.5 Fiat-Shamir Signature Scheme

< >4.3 Commitment Schemes

< >< >4.3.1 A Commitment Scheme Based on Quadratic Residues

< >< >4.3.2 A Commitment Scheme Based on Discrete Logarithms

< >< >4.3.3 Homomorphic Commitments

< >4.4 Electronic Elections

< >< >4.4.1 Secret Sharing

< >< >44.42 A Multi-Authority Election Scheme

< >< >1.4.3 Proofs of Knowledge

< >< >4.4.4 Non-Interactive Proofs of Knowledge

< >< >4.4.5 Extension to Multi-Way Elections

< >< >1.4.6 Eliminating the Trusted Center

< >4.5 Digital Cash

< >< >4.5.1 Blindly Issued Proofs

< >< >4.5.2 A Fair Electronic Cash System

< >< >4.5.3 Underlying Problems

5. Probabilistic Algorithms

< >5.1 Coin-Tossing Algorithms

< >5.2 Monte Carlo and Las Vegas Algorithms

6. One-Way Functions and the Basic Assumptions

< >6.1 A Notation for Probabilities

< >6.2 Discrete Exponential Function

< >6.3 Uniform Sampling Algorithms

< >6.4 Modular Powers

< >6.5 Modular Squaring

< >6.6 Quadratic Residuosity Property

< >6.7 Formal Definition of One-Way Functions

< >6.8 Hard-Core Predicates

7. Bit Security of One-Way Functions

< >7.1 Bit Security of the Exp Family

< >7.2 Bit Security of the RSA Family

< >7.3 Bit Security of the Square Family

8. One-Way Functions and Pseudorandomness

< >8.1 Computationally Perfect Pseudorandom Bit Generators

< >8.2 Yao's Theorem

9. Provably Secure Encryption

< >9.1 Classical Information-Theoretic Security

< >9.2 Perfect Secrecy and Probabilistic Attacks

< >9 3 Public-Key One-Time Pads

< >9.4 Passive Eavesdroppers

< >9.5 Chosen-Ciphertext Attacks

< >< >9.5.1 A Security Proof in the Random Oracle Model

< >< >9.5.2 Security Under Standard Assumptions

< >9.6 Unconditional Security of Cryptosystems

< >< >9.6.1 The Bounded Storage Model

< >< >9.6.2 The Noisy Channel Model

10. Provably Secure Digital Signatures

< >10.1 Attacks and Levels of Security

< >10.2 Claw-Free Pairs and Collision-Resistant Hash Functions

< >10.3 Authentication-Tree-Based Signatures

< >10.4 A State-Free Signature Scheme

---

Availability

Detail Information

Series Title

null

Call Number

005.82 DEL i

Publisher

Heidelberg : Springer., 2007

Collation

xvi, 367 hlm.; ilus.; 24 cm.

Language

English

ISBN/ISSN

9783540492436

Classification

005.82

Content Type

-

Media Type

-

Carrier Type

-

Edition

Second Edition

Subject(s)

Cryptography
Computer security
Computer Networks-Security Measures

Specific Detail Info

-

Statement of Responsibility

Hans Delfs dan Helmut Knebl

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment