The Theory of Hash Functions and Random Oracles [E-Book] : An Approach to Modern Cryptography / by Arno Mittelbach, Marc Fischlin.
Hash functions are the cryptographer's Swiss Army knife. Even though they play an integral part in today's cryptography, existing textbooks discuss hash functions only in passing and instead often put an emphasis on other primitives like encryption schemes. In this book the authors take a...
Saved in:
Full text |
|
Personal Name(s): | Mittelbach, Arno, author |
Fischlin, Marc, author | |
Edition: |
1st edition 2021. |
Imprint: |
Cham :
Springer,
2021
|
Physical Description: |
XXIII, 788 pages 109 illustrations (online resource) |
Note: |
englisch |
ISBN: |
9783030632878 |
DOI: |
10.1007/978-3-030-63287-8 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Information Security and Cryptography
|
Subject (LOC): |
- Introduction
- Preliminaries: Cryptographic Foundations
- Part I: Foundations
- Computational Security
- Pseudorandomness and Computational Indistinguishability
- Collision Resistance
- Encryption Schemes
- Signature Schemes
- Non-cryptographic Hashing
- Part II: The Random Oracle Methodology
- The Random Oracle Model
- The Full Power of Random Oracles
- Random Oracle Schemes in Practice
- Limitations of Random Oracles
- The Random Oracle Controversy
- Part III: Hash Function Constructions
- Iterated Hash Functions
- Constructing Compression Functions
- Iterated Hash Functions in Practice
- Constructions of Keyed Hash Functions
- Constructing Random Oracles: Indifferentiability
- Constructing Random Oracles: UCEs
- Index.