PACKT (406)
Text Book 교재용원서 (673)
컴퓨터공학 (819)
컴퓨터 일반도서 (554)
전기,전자공학 (713)
기계공학 (199)
재료공학 (34)
에너지공학 (65)
의용공학 (39)
생명과학 (230)
물리학 (427)
지구과학 (74)
천문학 (39)
수학 (103)
통계학 (46)
경영학 (41)
산업공학 (12)
사회복지학 (5)
심리학 (247)
교육학 (1)
화학 (5)
기타 (64)
특가할인도서 (택배비별도) (87)

> > 컴퓨터공학 > 암호

이미지를 클릭하시면 큰 이미지를 보실 수 있습니다.
Introduction to Modern Cryptography, Third Edition
출판사 : CRC
저 자 : Jonathan Katz
ISBN : 9780815354369
발행일 : 2019-11
도서종류 : 외국도서
발행언어 : 영어
페이지수 : 650
판매가격 : 95,000원
판매여부 : 재고확인요망
주문수량 : [+]수량을 1개 늘입니다 [-]수량을 1개 줄입니다

My Wish List 에 저장하기
   Introduction to Modern Cryptography, Third Edition 목차
Table of Contents

Preface

I. Introduction and Classical Cryptography

Introduction

Cryptography and Modern Cryptography

The Setting of Private-Key Encryption

Historical Ciphers and Their Cryptanalysis

Principles of Modern Cryptography

Principle 1 – Formal Definitions

Principle 2 – Precise Assumptions

Principle 3 – Proofs of Security

Provable Security and Real-World Security

References and Additional Reading

Exercises

Perfectly Secret Encryption

Definitions

The One-Time Pad

Limitations of Perfect Secrecy

Shannon’s Theorem

References and Additional Reading

Exercises

II. Private-Key (Symmetric) Cryptography

Private-Key Encryption

Computational Security

The Concrete Approach

The Asymptotic Approach

Defining Computationally Secure Encryption

The Basic Definition of Security

Semantic Security

Constructing Secure Encryption Schemes

Pseudorandom Generators and Stream Ciphers

Proofs by Reduction

A Secure Fixed-Length Encryption Scheme

Stronger Security Notions

Security for Multiple Encryptions

Chosen-Plaintext Attacks and CPA-Security

Constructing CPA-Secure Encryption Schemes

Pseudorandom Functions and Block Ciphers

CPA-Secure Encryption from Pseudorandom Functions

Modes of Operation

Stream-Cipher Modes of Operation

Block-Cipher Modes of Operation

Chosen-Ciphertext Attacks

Defining CCA-Security

Padding-Oracle Attacks

References and Additional Reading

Exercises

Message Authentication Codes

Message Integrity

Secrecy vs. Integrity

Encryption vs. Message Authentication

Message Authentication Codes – Definitions

Constructing Secure Message Authentication Codes

A Fixed-Length MAC

Domain Extension for MACs

CBC-MAC

The Basic Construction

Proof of Security

Authenticated Encryption

Definitions

Generic Constructions

Secure Communication Sessions

CCA-Secure Encryption

Information-Theoretic MACs

Constructing Information-Theoretic MACs

Limitations on Information-Theoretic MACs

References and Additional Reading

Exercises

Hash Functions and Applications

Definitions

Collision Resistance

Weaker Notions of Security

Domain Extension: The Merkle–Damgård Transform

Message Authentication Using Hash Functions

Hash-and-MAC

HMAC

Generic Attacks on Hash Functions

Birthday Attacks for Finding Collisions

Small-Space Birthday Attacks

Time/Space Tradeoffs for Inverting Functions

The Random-Oracle Model

The Random-Oracle Model in Detail

Is the Random-Oracle Methodology Sound?

Additional Applications of Hash Functions

Fingerprinting and Deduplication

Merkle Trees

Password Hashing

Key Derivation

Commitment Schemes

References and Additional Reading

Exercises

Practical Constructions of Symmetric-Key Primitives

Stream Ciphers

Linear-Feedback Shift Registers

Adding Nonlinearity

Trivium

RC4

Block Ciphers

Substitution-Permutation Networks

Feistel Networks

DES – The Data Encryption Standard

3DES: Increasing the Key Length of a Block Cipher

AES – The Advanced Encryption Standard

Differential and Linear Cryptanalysis

Hash Functions

Hash Functions from Block Ciphers

MD5

SHA-0, SHA-1, and SHA-2

SHA-3 (Keccak)

References and Additional Reading

Exercises

Theoretical Constructions of Symmetric-Key Primitives

One-Way Functions

Definitions

Candidate One-Way Functions

Hard-Core Predicates

From One-Way Functions to Pseudorandomness

Hard-Core Predicates from One-Way Functions

A Simple Case

A More Involved Case

The Full Proof

Constructing Pseudorandom Generators

Pseudorandom Generators with Minimal Expansion

Increasing the Expansion Factor

Constructing Pseudorandom Functions

Constructing (Strong) Pseudorandom Permutations

Assumptions for Private-Key Cryptography

Computational Indistinguishability

References and Additional Reading

Exercises

III. Public-Key (Asymmetric) Cryptography

Number Theory and Cryptographic Hardness Assumptions

Preliminaries and Basic Group Theory

Primes and Divisibility

Modular Arithmetic

Groups

The Group Z□N

Isomorphisms and the Chinese Remainder Theorem

Primes, Factoring, and RSA

Generating Random Primes

Primality Testing

The Factoring Assumption

The RSA Assumption

Relating the RSA and Factoring Assumptions

Cryptographic Assumptions in Cyclic Groups

Cyclic Groups and Generators

The Discrete-Logarithm/Diffie–Hellman Assumptions

Working in (Subgroups of) Z□p

Elliptic Curves

Cryptographic Applications

One-Way Functions and Permutations

Constructing Collision-Resistant Hash Functions

References and Additional Reading

Exercises

Algorithms for Factoring and Computing Discrete Logarithms

Algorithms for Factoring

Pollard’s p − 1 Algorithm

Pollard’s Rho Algorithm

The Quadratic Sieve Algorithm

Algorithms for Computing Discrete Logarithms

The Pohlig–Hellman Algorithm

The Baby-Step/Giant-Step Algorithm

Discrete Logarithms from Collisions

The Index Calculus Algorithm

Recommended Key Lengths

References and Additional Reading

Exercises

Key Management and the Public-Key Revolution

Key Distribution and Key Management

A Partial Solution: Key-Distribution Centers

Key Exchange and the Diffie–Hellman Protocol

The Public-Key Revolution

References and Additional Reading

Exercises

Public-Key Encryption

Public-Key Encryption – An Overview

Definitions

Security against Chosen-Plaintext Attacks

Multiple Encryptions

Security against Chosen-Ciphertext Attacks

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 in the Random-Oracle Model

Chosen-Ciphertext Security and DHIES/ECIES

RSA Encryption

Plain RSA

Padded RSA and PKCS #1 v1.5

CPA-Secure Encryption without Random Oracles

OAEP and RSA PKCS #1 v

A CCA-Secure KEM in the Random-Oracle Model

RSA Implementation Issues and Pitfalls

References and Additional Reading

Exercises

Digital Signature Schemes

Digital Signatures – An Overview

Definitions

The Hash-and-Sign Paradigm

RSA Signatures

Plain RSA

RSA-FDH and PKCS #1 v

Signatures from the Discrete-Logarithm Problem

The Schnorr Signature Scheme

DSA and ECDSA

Signatures from Hash Functions

Lamport’s Signature Scheme

Chain-Based Signatures

Tree-Based Signatures

Certificates and Public-Key Infrastructures

Putting It All Together – SSL/TLS

Signcryption

References and Additional Reading

Exercises

Advanced Topics in Public-Key Encryption

Public-Key Encryption from Trapdoor Permutations

Trapdoor Permutations

Public-Key Encryption from Trapdoor Permutations

The Paillier Encryption Scheme

The Structure of Z□N2

The Paillier Encryption Scheme

Homomorphic Encryption

Secret Sharing and Threshold Encryption

Secret Sharing

Verifiable Secret Sharing

Threshold Encryption and Electronic 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 Square Roots

A Trapdoor Permutation Based on Factoring

The Rabin Encryption Scheme

References and Additional Reading

Exercises

Index of Common Notation

Appendix A: Mathematical Background

Identities and Inequalities

Asymptotic Notation

Basic Probability

The "Birthday" Problem

Finite Fields

Appendix B: Basic Algorithmic Number Theory

Integer Arithmetic

Basic Operations

The Euclidean and Extended Euclidean Algorithms

Modular Arithmetic

Basic Operations

Computing Modular Inverses

Modular Exponentiation

Montgomery Multiplication

Choosing a Uniform Group Element

Finding a Generator of a Cyclic Group

Group-Theoretic Background

Efficient Algorithms

References and Additional Reading

Exercises

References

Index
   도서 상세설명   



Cryptography is ubiquitous and plays a key role in ensuring data secrecy and integrity as well as in securing computer systems more broadly. Introduction to Modern Cryptography provides a rigorous yet accessible treatment of this fascinating subject.

The authors introduce the core principles of modern cryptography, with an emphasis on formal definitions, clear assumptions, and rigorous proofs of security. The book begins by focusing on private-key cryptography, including an extensive treatment of private-key encryption, message authentication codes, and hash functions. The authors also present design principles for widely used stream ciphers and block ciphers including RC4, DES, and AES, plus provide provable constructions of stream ciphers and block ciphers from lower-level primitives. The second half of the book covers public-key cryptography, beginning with a self-contained introduction to the number theory needed to understand the RSA, Diffie-Hellman, and El Gamal cryptosystems (and others), followed by a thorough treatment of several standardized public-key encryption and digital signature schemes.

Integrating a more practical perspective without sacrificing rigor, this widely anticipated Second Edition offers improved treatment of:

Stream ciphers and block ciphers, including modes of operation and design principles
Authenticated encryption and secure communication sessions
Hash functions, including hash-function applications and design principles
Attacks on poorly implemented cryptography, including attacks on chained-CBC encryption, padding-oracle attacks, and timing attacks
The random-oracle model and its application to several standardized, widely used public-key encryption and signature schemes
Elliptic-curve cryptography and associated standards such as DSA/ECDSA and DHIES/ECIES

  교육용 보조자료   
작성된 교육용 보조자료가 없습니다.