skip to content
Introduction to modern cryptography Preview this item
ClosePreview this item

Introduction to modern cryptography

Author: Jonathan Katz; Yehuda Lindell; CRC Press.
Publisher: Boca Raton : CRC Press, Taylor & Francis Group, cop. 2015.
Series: Chapman & Hall/CRC Cryptography and Network Security.
Edition/Format:   Print book : English : 2nd edView all editions and formats
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


Genre/Form: podręczniki akademickie
Document Type: Book
All Authors / Contributors: Jonathan Katz; Yehuda Lindell; CRC Press.
ISBN: 9781466570269 1466570261
OCLC Number: 909989705
Notes: Na okł. i s. tyt.: A Champan & Hall Book.
Description: XX, 583 s. : il. ; 24 cm.
Contents: PrefaceI. Introduction and Classical CryptographyIntroductionCryptography and Modern CryptographyThe Setting of Private-Key EncryptionHistorical Ciphers and Their CryptanalysisPrinciples of Modern CryptographyPrinciple 1 - Formal DefinitionsPrinciple 2 - Precise AssumptionsPrinciple 3 - Proofs of SecurityProvable Security and Real-World SecurityReferences and Additional ReadingExercisesPerfectly Secret EncryptionDefinitionsThe One-Time PadLimitations of Perfect SecrecyShannon's TheoremReferences and Additional ReadingExercisesII. Private-Key (Symmetric) CryptographyPrivate-Key EncryptionComputational SecurityThe Concrete ApproachThe Asymptotic ApproachDefining Computationally Secure EncryptionThe Basic Definition of SecuritySemantic SecurityConstructing Secure Encryption SchemesPseudorandom Generators and Stream CiphersProofs by ReductionA Secure Fixed-Length Encryption SchemeStronger Security NotionsSecurity for Multiple EncryptionsChosen-Plaintext Attacks and CPA-SecurityConstructing CPA-Secure Encryption SchemesPseudorandom Functions and Block CiphersCPA-Secure Encryption from Pseudorandom FunctionsModes of OperationStream-Cipher Modes of OperationBlock-Cipher Modes of OperationChosen-Ciphertext AttacksDefining CCA-SecurityPadding-Oracle AttacksReferences and Additional ReadingExercisesMessage Authentication CodesMessage IntegritySecrecy vs. IntegrityEncryption vs. Message AuthenticationMessage Authentication Codes - DefinitionsConstructing Secure Message Authentication CodesA Fixed-Length MACDomain Extension for MACsCBC-MACThe Basic ConstructionProof of SecurityAuthenticated EncryptionDefinitionsGeneric ConstructionsSecure Communication SessionsCCA-Secure EncryptionInformation-Theoretic MACsConstructing Information-Theoretic MACsLimitations on Information-Theoretic MACsReferences and Additional ReadingExercisesHash Functions and ApplicationsDefinitionsCollision ResistanceWeaker Notions of SecurityDomain Extension: The Merkle-Damgard TransformMessage Authentication Using Hash FunctionsHash-and-MACHMACGeneric Attacks on Hash FunctionsBirthday Attacks for Finding CollisionsSmall-Space Birthday AttacksTime/Space Tradeoffs for Inverting FunctionsThe Random-Oracle ModelThe Random-Oracle Model in DetailIs the Random-Oracle Methodology Sound?Additional Applications of Hash FunctionsFingerprinting and DeduplicationMerkle TreesPassword HashingKey DerivationCommitment SchemesReferences and Additional ReadingExercisesPractical Constructions of Symmetric-Key PrimitivesStream CiphersLinear-Feedback Shift RegistersAdding NonlinearityTriviumRC4Block CiphersSubstitution-Permutation NetworksFeistel NetworksDES - The Data Encryption Standard3DES: Increasing the Key Length of a Block CipherAES - The Advanced Encryption StandardDifferential and Linear CryptanalysisHash FunctionsHash Functions from Block CiphersMD5SHA-0, SHA-1, and SHA-2SHA-3 (Keccak)References and Additional ReadingExercisesTheoretical Constructions of Symmetric-Key PrimitivesOne-Way FunctionsDefinitionsCandidate One-Way FunctionsHard-Core PredicatesFrom One-Way Functions to PseudorandomnessHard-Core Predicates from One-Way FunctionsA Simple CaseA More Involved CaseThe Full ProofConstructing Pseudorandom GeneratorsPseudorandom Generators with Minimal ExpansionIncreasing the Expansion FactorConstructing Pseudorandom FunctionsConstructing (Strong) Pseudorandom PermutationsAssumptions for Private-Key CryptographyComputational IndistinguishabilityReferences and Additional ReadingExercisesIII. Public-Key (Asymmetric) CryptographyNumber Theory and Cryptographic Hardness AssumptionsPreliminaries and Basic Group TheoryPrimes and DivisibilityModular ArithmeticGroupsThe Group ZNIsomorphisms and the Chinese Remainder Theorem Primes, Factoring, and RSAGenerating Random PrimesPrimality TestingThe Factoring AssumptionThe RSA AssumptionRelating the RSA and Factoring AssumptionsCryptographic Assumptions in Cyclic GroupsCyclic Groups and GeneratorsThe Discrete-Logarithm/Diffie-Hellman AssumptionsWorking in (Subgroups of) ZpElliptic CurvesCryptographic ApplicationsOne-Way Functions and PermutationsConstructing Collision-Resistant Hash FunctionsReferences and Additional ReadingExercisesAlgorithms for Factoring and Computing Discrete LogarithmsAlgorithms for FactoringPollard's p 1 AlgorithmPollard's Rho AlgorithmThe Quadratic Sieve AlgorithmAlgorithms for Computing Discrete LogarithmsThe Pohlig-Hellman AlgorithmThe Baby-Step/Giant-Step AlgorithmDiscrete Logarithms from CollisionsThe Index Calculus AlgorithmRecommended Key LengthsReferences and Additional ReadingExercisesKey Management and the Public-Key RevolutionKey Distribution and Key ManagementA Partial Solution: Key-Distribution CentersKey Exchange and the Diffie-Hellman ProtocolThe Public-Key RevolutionReferences and Additional ReadingExercisesPublic-Key EncryptionPublic-Key Encryption - An OverviewDefinitionsSecurity against Chosen-Plaintext AttacksMultiple EncryptionsSecurity against Chosen-Ciphertext AttacksHybrid Encryption and the KEM/DEM ParadigmCPA-SecurityCCA-SecurityCDH/DDH-Based EncryptionEl Gamal EncryptionDDH-Based Key EncapsulationA CDH-Based KEM in the Random-Oracle ModelChosen-Ciphertext Security and DHIES/ECIESRSA EncryptionPlain RSAPadded RSA and PKCS #1 v1.5CPA-Secure Encryption without Random Oracles OAEP and RSA PKCS #1 vA CCA-Secure KEM in the Random-Oracle Model RSA Implementation Issues and PitfallsReferences and Additional ReadingExercisesDigital Signature SchemesDigital Signatures - An OverviewDefinitionsThe Hash-and-Sign ParadigmRSA SignaturesPlain RSARSA-FDH and PKCS #1 vSignatures from the Discrete-Logarithm ProblemThe Schnorr Signature SchemeDSA and ECDSASignatures from Hash FunctionsLamport's Signature SchemeChain-Based SignaturesTree-Based SignaturesCertificates and Public-Key InfrastructuresPutting It All Together - SSL/TLSSigncryptionReferences and Additional ReadingExercisesAdvanced Topics in Public-Key EncryptionPublic-Key Encryption from Trapdoor PermutationsTrapdoor PermutationsPublic-Key Encryption from Trapdoor PermutationsThe Paillier Encryption SchemeThe Structure of ZN2The Paillier Encryption SchemeHomomorphic EncryptionSecret Sharing and Threshold EncryptionSecret SharingVerifiable Secret SharingThreshold Encryption and Electronic VotingThe Goldwasser-Micali Encryption SchemeQuadratic Residues Modulo a PrimeQuadratic Residues Modulo a CompositeThe Quadratic Residuosity AssumptionThe Goldwasser-Micali Encryption SchemeThe Rabin Encryption SchemeComputing Modular Square RootsA Trapdoor Permutation Based on FactoringThe Rabin Encryption SchemeReferences and Additional ReadingExercisesIndex of Common NotationAppendix A: Mathematical BackgroundIdentities and InequalitiesAsymptotic NotationBasic ProbabilityThe "Birthday" ProblemFinite FieldsAppendix B: Basic Algorithmic Number TheoryInteger ArithmeticBasic OperationsThe Euclidean and Extended Euclidean AlgorithmsModular ArithmeticBasic OperationsComputing Modular InversesModular ExponentiationMontgomery MultiplicationChoosing a Uniform Group ElementFinding a Generator of a Cyclic GroupGroup-Theoretic BackgroundEfficient AlgorithmsReferences and Additional ReadingExercisesReferencesIndex
Series Title: Chapman & Hall/CRC Cryptography and Network Security.
Other Titles: Modern cryptography
Responsibility: Jonathan Katz, Yehuda Lindell.
Retrieving notes about this item Retrieving notes about this item


Editorial reviews

Publisher Synopsis

"The work is comprehensive, rigorous, and yet accessible for dedicated students."-Computing Reviews, October 2015"... this book fills a significant gap among previous cryptography textbooks by 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.