Introduction to modern cryptography (Book, 2008) [Portland Community College Library]
skip to content
Introduction to modern cryptography Preview this item
ClosePreview this item

Introduction to modern cryptography

Author: Jonathan Katz; Yehuda Lindell
Publisher: Boca Raton, FL : Chapman & Hall/CRC, 2008
Series: Chapman and Hall/CRC cryptography and network security
Edition/Format:   Print book : EnglishView all editions and formats
With an emphasis on precise definitions of cryptography as well as provable security, "Introduction to Modern Cryptography: Principles and Protocols" presents many definitions, formal and precise assumptions, and rigorous proofs along with the appropriate motivation and intuition. This book provides coverage of such topics as pseudorandom number generators/functions and the random oracle model. The authors discuss  Read more...
Getting this item's online copy... Getting this item's online copy...

Find a copy in the library

Getting this item's location and availability... Getting this item's location and availability...


Find it in libraries globally
Worldwide libraries own this item


Document Type: Book
All Authors / Contributors: Jonathan Katz; Yehuda Lindell
ISBN: 1584885513 9781584885511
OCLC Number: 474193364
Description: xviii, 534 s
Contents: PREFACEINTRODUCTION AND CLASSICAL CRYPTOGRAPHY INTRODUCTION Cryptography and Modern Cryptography The Setting of Private-Key Encryption Historical Ciphers and Their Cryptanalysis The Basic Principles of Modern Cryptography PERFECTLY SECRET ENCRYPTION Definitions and Basic Properties The One-Time Pad (Vernam's Cipher) Limitations of Perfect Secrecy Shannon's Theorem Summary PRIVATE-KEY (SYMMETRIC) CRYPTOGRAPHY PRIVATE-KEY ENCRYPTION AND PSEUDORANDOMNESSA Computational Approach to CryptographyA Definition of Computationally Secure EncryptionPseudorandomnessConstructing Secure Encryption SchemesSecurity against Chosen-Plaintext Attacks (CPA) Constructing CPA-Secure Encryption SchemesSecurity against Chosen-Ciphertext Attacks (CCA)MESSAGE AUTHENTICATION CODES AND COLLISION-RESISTANT HASH FUNCTIONSSecure Communication and Message Integrity Encryption vs. Message Authentication Message Authentication Codes-DefinitionsConstructing Secure Message Authentication CodesCBC-MACCollision-Resistant Hash FunctionsNMAC and HMACConstructing CCA-Secure Encryption Schemes Obtaining Privacy and Message AuthenticationPRACTICAL CONSTRUCTIONS OF PSEUDORANDOM PERMUTATIONS (BLOCK CIPHERS)Substitution-Permutation Networks Feistel NetworksThe Data Encryption Standard (DES)Increasing the Key Size of a Block Cipher The Advanced Encryption Standard (AES)Differential and Linear Cryptanalysis-A Brief LookTHEORETICAL CONSTRUCTIONS OF PSEUDORANDOM OBJECTS One-Way Functions Overview: From One-Way Functions to PseudorandomnessA Hard-Core Predicate for Any One-Way FunctionConstructing Pseudorandom Generators Constructing Pseudorandom Functions Constructing (Strong) Pseudorandom Permutations Necessary Assumptions for Private-Key CryptographyA Digression-Computational IndistinguishabilityPUBLIC-KEY (ASYMMETRIC) CRYPTOGRAPHY NUMBER THEORY AND CRYPTOGRAPHIC HARDNESS ASSUMPTIONS Preliminaries and Basic Group TheoryPrimes, Factoring, and RSAAssumptions in Cyclic GroupsCryptographic Applications of Number-Theoretic AssumptionsFACTORING AND COMPUTING DISCRETE LOGARITHMS Algorithms for FactoringAlgorithms for Computing Discrete LogarithmsPRIVATE-KEY MANAGEMENT AND THE PUBLIC-KEY REVOLUTION Limitations of Private-Key CryptographyA Partial Solution-Key Distribution CentersThe Public-Key RevolutionDiffie-Hellman Key ExchangePUBLIC-KEY ENCRYPTION Public-Key Encryption-An OverviewDefinitionsHybrid Encryption RSA EncryptionThe El Gamal Encryption Scheme Security against CCATrapdoor PermutationsADDITIONAL PUBLIC-KEY ENCRYPTION SCHEMESThe Goldwasser-Micali Encryption SchemeThe Rabin Encryption SchemeThe Paillier Encryption SchemeDIGITAL SIGNATURE SCHEMESDigital Signatures-An OverviewDefinitionsRSA SignaturesThe Hash-and-Sign Paradigm Lamport's One-Time Signature Scheme Signatures from Collision-Resistant HashingThe Digital Signature Standard Certificates and Public-Key InfrastructuresPUBLIC-KEY CRYPTOSYSTEMS IN THE RANDOM ORACLE MODEL The Random Oracle Methodology Public-Key Encryption in the Random Oracle Model Signatures in the Random Oracle ModelAPPENDIX A: MATHEMATICAL BACKGROUND Identities and InequalitiesAsymptotic NotationBasic Probability The Birthday Problem APPENDIX B: SUPPLEMENTARY ALGORITHMIC NUMBER THEORY Integer ArithmeticModular Arithmetic Finding a Generator of a Cyclic GroupINDEXEach chapter contains References, Additional Reading, and Exercises.
Series Title: Chapman and Hall/CRC cryptography and network security
Responsibility: Jonathan Katz, Yehuda Lindell


Offers an accessible treatment of modern cryptography, with a focus on formal definitions, precise assumptions, and rigorous proofs. This work introduces the core principles of modern cryptography,  Read more...
Retrieving notes about this item Retrieving notes about this item


Editorial reviews

Publisher Synopsis

This book is a comprehensive, rigorous introduction to what the authors name `modern' cryptography ... a novel approach to how cryptography is taught, replacing the older, construction-based Read more...

User-contributed reviews


Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.