Find a copy in the library
Finding libraries that hold this item...
Details
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 |
Abstract:
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 approach. ... The concepts are clearly stated, both in an intuitive fashion and formally. ... I would heartily recommend this book to anyone who is interested in cryptography. ... the exercises are challenging and interesting, and can benefit readers of all academic levels. ...-IACR book reviews, January 2010Over the past 30 years, cryptography has been transformed from a mysterious art into a mathematically rigorous science. The textbook by Jonathan Katz and Yehuda Lindell finally makes this modern approach to cryptography accessible to a broad audience. Readers of this text will learn how to think precisely about the security of protocols against arbitrary attacks, a skill that will remain relevant and useful regardless of how technology and cryptography standards change. The book uses just enough formalism to maintain precision and rigor without obscuring the development of ideas. It manages to convey both the theory's conceptual beauty and its relevance to practice. I plan to use it every time I teach an undergraduate course in cryptography.-Salil Vadhan, Harvard University, Cambridge, Massachusetts, USA... the greatest attribute is the fact that the material is presented in such a unified way. These are not just a collection of topics from cryptography, thrown together at random. One topic leads effortlessly to the next. As such, this is a virtually indispensible resource for modern cryptography.-Donald L. Vestal, South Dakota State University, MAA Online, July 2008... gives an excellent introduction to the theoretical background of cryptography. It would be a fine textbook for an advanced undergraduate (or graduate) course in theoretical computer science for students who have already seen the rudiments of cryptography. It will be a valuable reference for researchers in the field ...-Steven D. Galbraith, Mathematical Reviews, 2009bThe book is highly recommended as a textbook in cryptography courses at graduate or advanced undergraduate levels ... covers in a splendid way the main notions of current cryptography from the point of view of information-theoretical security. This corresponds indeed to a modern cryptography approach.-Guillermo Morales-Luna, Zentralblatt MATH, Vol. 1143 Read more...

