Introduction to Modern Cryptography, Third Edition-Test Bank

Desk of Contents
I Introduction and Classical Cryptography

1. Introduction

Cryptography and Modern Cryptography

The Setting of Personal-Key Encryption

Historic Ciphers and Their Cryptanalysis

Concepts of Modern Cryptography

Principle 1 – Formal Definitions

Principle 2 – Actual Assumptions

Principle 3 – Proofs of Security

Provable Security and Precise-World Security

References and Additional Finding out

Exercise routines

2. Utterly Secret Encryption

Definitions

The One-Time Pad

Limitations of Good Secrecy

*Shannon’s Theorem

References and Additional Finding out

Exercise routines

II Personal-Key (Symmetric) Cryptography

3. Personal-Key Encryption

Computational Security

The Concrete Methodology

The Asymptotic Methodology

Defining Computationally Protected Encryption

The Main Definition of Security (EAV-Security)

*Semantic Security

Establishing an EAV-Protected Encryption Scheme

Pseudorandom Generators

Proofs by Low cost

EAV-Security from a Pseudorandom Generator

Stronger Security Notions

Security for Plenty of Encryptions

Chosen-Plaintext Assaults and CPA-Security

CPA-Security for Plenty of Encryptions

Establishing a CPA-Protected Encryption Scheme

Pseudorandom Capabilities and Permutations

CPA-Security from a Pseudorandom Carry out

Modes of Operation and Encryption in Apply

Stream Ciphers

Stream-Cipher Modes of Operation

Block Ciphers and Block-Cipher Modes of Operation

*Nonce-Based Encryption

References and Additional Finding out

Exercise routines

4. Message Authentication Codes

Message Integrity

Secrecy vs Integrity

Encryption vs Message Authentication

Message Authentication Codes (MACs) – Definitions

Establishing Protected Message Authentication Codes

A Mounted-Dimension MAC

Space Extension for MACs

CBC-MAC

The Main Improvement

*Proof of Security

GMAC and Poly

MACs from Distinction-Frequent Capabilities

Instantiations

*Data-Theoretic MACs

One-Time MACs from Strongly Frequent Capabilities

One-Time MACs from Distinction-Frequent Capabilities

Limitations on Data-Theoretic MACs

References and Additional Finding out

Exercise routines

5. CCA-Security and Authenticated Encryption

Chosen-Ciphertext Assaults and CCA-Security

Padding-Oracle Assaults

Defining CCA-Security

Authenticated Encryption

Defining Authenticated Encryption

CCA Security vs Authenticated Encryption

Authenticated Encryption Schemes

Generic Constructions

Standardized Schemes

Protected Communication Durations

References and Additional Finding out

Exercise routines

6. Hash Capabilities and Functions

Definitions

Collision Resistance

Weaker Notions of Security

Space Extension: The Merkle-Damgard Rework

Message Authentication Using Hash Capabilities

Hash-and-MAC

HMAC

Generic Assaults on Hash Capabilities

Birthday Assaults for Discovering Collisions

Small-Space Birthday Assaults

*Time/Space Tradeo s for Inverting Hash Capabilities

The Random-Oracle Model

The Random-Oracle Model in Factor

Is the Random-Oracle Methodology Sound?

Additional Functions of Hash Capabilities

Fingerprinting and Deduplication

Merkle Timber

Password Hashing

Key Derivation

Dedication Schemes

References and Additional Finding out

Exercise routines

7. Smart Constructions of Symmetric-Key Primitives

Stream Ciphers

Linear-Ideas Shift Registers

Together with Nonlinearity

Trivium

RC4

ChaCha20

Block Ciphers

Substitution-Permutation Networks

Feistel Networks

DES – The Data Encryption Customary

3 DES: Rising the Key Dimension of a Block Cipher

AES -The Superior Encryption Customary

*Differential and Linear Cryptanalysis

Compression Capabilities and Hash Capabilities

Compression Capabilities from Block Ciphers

MD5, SHA-1, and SHA-2

The Sponge Improvement and SHA-3 (Keccak)

References and Additional Finding out

Exercise routines

8. *Theoretical Constructions of Symmetric-Key Primitives

One-Means Capabilities

Definitions

Candidate One-Means Capabilities

Onerous-Core Predicates

From One-Means Capabilities to Pseudorandomness

Onerous-Core Predicates from One-Means Capabilities

A Simple Case

A Additional Involved Case

The Full Proof

Establishing Pseudorandom Generators

Pseudorandom Generators with Minimal Enlargement

Rising the Enlargement Difficulty

Establishing Pseudorandom Capabilities

Establishing (Sturdy) Pseudorandom Permutations

Assumptions for Personal-Key Cryptography

Computational Indistinguishability

References and Additional Finding out

Exercise routines

III Public-Key (Uneven) Cryptography

9. Amount Idea and Cryptographic Hardness Assumptions

Preliminaries and Main Group Idea

Primes and Divisibility

Modular Arithmetic

Groups

The Group ZN

*Isomorphisms and the Chinese language language The remaining Theorem

Primes, Factoring, and RSA

Producing Random Primes

*Primality Testing

The Factoring Assumption

The RSA Assumption

*Relating the Factoring and RSA Assumptions

Cryptographic Assumptions in Cyclic Groups

Cyclic Groups and Generators

The Discrete-Logarithm/Diffie-Hellman Assumptions

Working in (Subgroups of) Zp

Elliptic Curves

*Cryptographic Functions

One-Means Capabilities and Permutations

Collision-Resistant Hash Capabilities

References and Additional Finding out

Exercise routines

10. *Algorithms for Factoring and Computing Discrete Logarithms

Algorithms for Factoring

Pollard’s p – Algorithm

Pollard’s Rho Algorithm

The Quadratic Sieve Algorithm

Generic Algorithms for Computing Discrete Logarithms

The Pohlig-Hellman Algorithm

The Little one-Step/Massive-Step Algorithm

Discrete Logarithms from Collisions

Index Calculus: Computing Discrete Logarithms in Zp

Useful Key Lengths

References and Additional Finding out

Exercise routines

11. Key Administration and the Public-Key Revolution

Key Distribution and Key Administration

A Partial Decision: Key-Distribution Services

Key Commerce and the Diffie-Hellman Protocol

The Public-Key Revolution

References and Additional Finding out

Exercise routines

12. Public-Key Encryption

Public-Key Encryption – An Overview

Definitions

Security in opposition to Chosen-Plaintext Assaults

Plenty of Encryptions

Security in opposition to Chosen-Ciphertext Assaults

Hybrid Encryption and the KEM/DEM Paradigm

CPA-Security

CCA-Security

CDH/DDH-Based Encryption

El Gamal Encryption

DDH-Based Key Encapsulation

*A CDH-Based KEM throughout the Random-Oracle Model

*Chosen-Ciphertext Security and DHIES/ECIES

RSA-Based Encryption

Plain RSA Encryption

Padded RSA and PKCS # v

*CPA-Protected Encryption with out Random Oracles

OAEP and PKCS # v

*A CCA-Protected KEM throughout the Random-Oracle Model

RSA Implementation Factors and Pitfalls

References and Additional Finding out

Exercise routines

13. Digital Signature Schemes

Digital Signatures – An Overview

Definitions

The Hash-and-Sign Paradigm

RSA-Based Signatures

Plain RSA Signatures

RSA-FDH and PKCS #1 Necessities

Signatures from the Discrete-Logarithm Downside

Identification Schemes and Signatures

The Schnorr Identification/Signature Schemes

DSA and ECDSA

Certificates and Public-Key Infrastructures

Putting It All Collectively { TLS

*Signcryption

References and Additional Finding out

Exercise routines

14. *Publish-Quantum Cryptography

Publish-Quantum Symmetric-Key Cryptography

Grover’s Algorithm and Symmetric-Key Lengths

Collision-Discovering Algorithms and Hash Capabilities

Shor’s Algorithm and its Have an effect on on Cryptography

Publish-Quantum Public-Key Encryption

Publish-Quantum Signatures

Lamport’s Signature Scheme

Chain-Based Signatures

Tree-Based Signatures

References and Additional Finding out

Exercise routines

15. *Superior Issues in Public-Key Encryption

Public-Key Encryption from Trapdoor Permutations

Trapdoor Permutations

Public-Key Encryption from Trapdoor Permutations

The Paillier Encryption Scheme

The Building of Z_N

The Paillier Encryption Scheme

Homomorphic Encryption

Secret Sharing and Threshold Encryption

Secret Sharing

Verifiable Secret Sharing

Threshold Encryption and Digital Voting

The Goldwasser-Micali Encryption Scheme

Quadratic Residues Modulo a Prime

Quadratic Residues Modulo a Composite

The Quadratic Residuosity Assumption

The Goldwasser-Micali Encryption Scheme

The Rabin Encryption Scheme

Computing Modular Sq. Roots

A Trapdoor Permutation Based on Factoring

The Rabin Encryption Scheme

References and Additional Finding out

Exercise routines

Index of Widespread Notation

Appendix A Mathematical Background

A Identities and Inequalities

A Asymptotic Notation

A Main Likelihood

A The Birthday” Downside

A *Finite Fields

Appendix B Main Algorithmic Amount Idea

B Integer Arithmetic

B Main Operations

B The Euclidean and Extended Euclidean Algorithms

B Modular Arithmetic

B Main Operations

B Computing Modular Inverses

B Modular Exponentiation

B *Montgomery Multiplication

B Deciding on a Uniform Group Element

B *Discovering a Generator of a Cyclic Group

B Group-Theoretic Background

B Atmosphere pleasant Algorithms

References and Additional Finding out

Exercise routines