Handbook of applied cryptography (Computer file, 1997) [WorldCat.org]
skip to content
Handbook of applied cryptography

Handbook of applied cryptography

Author: Alfred J Menezes; Paul C van Oorschot; Scott A Vanstone
Edition/Format:   Computer file : English : [Online-ausg.]View all editions and formats

Cryptography, in particular public-key cryptography, has emerged an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information  Read more...


(not yet rated) 0 with reviews - Be the first.

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Document Type: Computer File
All Authors / Contributors: Alfred J Menezes; Paul C van Oorschot; Scott A Vanstone
ISBN: 0849385237 9780849385230
OCLC Number: 179928632
Reproduction Notes: Boca Raton, Fla. [u.a.] CRC Press. Online-Ausg.
Description: XXVIII, 780 S. : Ill
Contents: Foreword by Ronald L. RivestOverview of CryptographyIntroductionInformation security and cryptographyBackground on functions Functions(1-1, one-way, trapdoor one-way) Permutations InvolutionsBasic terminology and conceptsSymmetric-key encryption Overview of block ciphers and stream ciphers Substitution ciphers and transposition ciphers Composition of ciphers Stream ciphers The key spaceDigital signaturesAuthentication and identification Identification Data origin authenticationPublic-key cryptography Public-key encryption The necessity of authentication in public-key systems Digital signatures from reversible public-key encryption Symmetric-key versus public-key cryptographyHash functionsProtocols and mechanismsKey establishment, management, and certification Key management through symmetric-key techniques Key management through public-key techniques Trusted third parties and public-key certificatesPseudorandom numbers and sequencesClasses of attacks and security models Attacks on encryption schemes Attacks on protocols Models for evaluating security Perspective for computational securityNotes and further referencesMathematical BackgroundProbability theory Basic definitions Conditional probability Random variables Binomial distribution Birthday attacks Random mappingsInformation theory Entropy Mutual informationComplexity theory Basic definitions Asymptotic notation Complexity classes Randomized algorithmsNumber theory The integers Algorithms in Z The integers modulo n Algorithms in Zn The Legendre and Jacobi symbols Blum integersAbstract algebra Groups Rings Fields Polynomial rings Vector spacesFinite fields Basic properties The Euclidean algorithm for polynomials Arithmetic of polynomialsNotes and further referencesNumber-Theoretic Reference ProblemsIntroduction and overviewThe integer factorization problem Trial division Pollard's rho factoring algorithm Pollard's p - 1 factoring algorithm Elliptic curve factoring Random square factoring methods Quadratic sieve factoring Number field sieve factoringThe RSA problemThe quadratic residuosity problemComputing square roots in Zn Case (i): n prime Case (ii): n compositeThe discrete logarithm problem Exhaustive search Baby-step giant-step algorithm Pollard's rho algorithm for logarithms Pohlig-Hellman algorithm Index-calculus algorithm Discrete logarithm problem in subgroups of Z*pThe Diffie-Hellman problemComposite moduliComputing individual bits The discrete logarithm problem in Z*p - individual bits The RSA problem - individual bits The Rabin problem - individual bitsThe subset sum problem The L3-Iattice basis reduction algorithm Solving subset sum problems of low density Simultaneous diophantine approximationFactoring polynomials over finite fields Square-free factorization Beriekamp's Q-matrix algorithmNotes and further referencesPublic-Key Parameters Introduction Generating large prime numbers naively Distribution of prime numbersProbabilistic primality tests Fermat's test Solovay-Strassen test Miller-Rabin test Comparison: Fermat, Solovay-Strassen and Miller-Rabin(True) Primality tests Testing Mersenne numbers Primality testing using the factorization of n - 1 Jacobi sum test Tests using elliptic curvesPrime number generation Random search for probable primes Strong primes NIST method for generating DSA primes Constructive techniques for provable primesIrreducible polynomials over Zp Irreducible polynomials Irreducible trinomials Primitive polynomialsGenerators and elements of high order Selecting a prime p and generator of Z*pNotes and further referencesPseudorandom Bits and SequencesIntroduction Classification and frameworkRandom bit generationPseudorandom bit generation ANSI X9.17 FIPS 186Statistical tests The normal and chi-square distributions Hypothesis testing Golomb's randomness postulates Five basic tests Maurer's universal statistical testCryptographically secure pseudorandom bit generation RSA pseudorandom bit generator Blum-Blum-Shub pseudorandom bit generatorNotes and further referencesStream CiphersIntroduction ClassificationFeedback shift registers Linear feedback shift registers Linear complexity Berlekamp-Massey algorithm Nonlinear feedback shift registersStream ciphers based on LFSRs Nonlinear combination generators Nonlinear filter generators Clock-controlled generatorsOther stream ciphers SEALNotes and further referencesBlock CiphersIntroduction and overviewBackground and general concepts Introduction to block ciphers Modes of operation Exhaustive key search and multiple encryptionClassical ciphers and historical development Transposition ciphers Substitution ciphers Polyalphabetic substitutions and Vigenere ciphers Polyalphabetic cipher machines and rotors (historical) Cryptanalysis of classical ciphersDES Product ciphers and Feistel ciphers DES algorithm DES properties and strengthFEALIDEASAFER, RC5, and other block ciphers SAFER RC5 Other block ciphersNotes and further referencesPublic-Key EncryptionIntroduction Basic principlesRSA public-key encryption Description Security of RSA RSA encryption in practiceRabin public-key encryptionElGamal public-key encryption Basic ElGamal encryption Generalized ElGamal encryptionMcEliece public-key encryptionKnapsack public-key encryption Merkle-Hellman knapsack encryption Chor-Rivest knapsack encryptionProbabilistic public-key encryption Goldwasser-Micali probabilistic encryption Blum-Goldwasser probabilistic encryption Plaintext-aware encryptionNotes and further referencesHash Functions and Data IntegrityIntroductionClassification and framework General classification Basic properties and definitions Hash properties required for specific applications One-way functions and compression functions Relationships between properties Other hash function properties and applicationsBasic constructions and general results General model for iterated hash functions General constructions and extensions Formatting and initialization details Security objectives and basic attacks Bitsizes required for practical securityUnkeyed hash functions (MDCs) Hash functions based on block ciphers Customized hash functions based on MD4 Hash functions based on modular arithmeticKeyed hash functions (MACS) MACs based on block ciphers Constructing MACs from MDCs Customized MACs MACs for stream ciphersData integrity and message authentication Background and definitions Non-malicious vs. malicious threats to data integrity Data integrity using a MAC alone Data integrity using an MDC and an authentic channel Data integrity combined with encryptionAdvanced attacks on hash functions Birthday attacks Pseudo-collisions and compression function attacks Chaining attacks Attacks based on properties of underlying cipherNotes and further referencesIdentification and Entity AuthenticationIntroduction Identification objectives and applications Properties of identification protocolsPasswords (weak authentication) Fixed password schemes: techniques Fixed password schemes: attacks Case study - UNIX passwords PINs and passkeys One-time passwords (towards strong authentication)Challenge-response identification (strong authentication) Background on time-variant parameters Challenge-response by symmetric-key techniques Challenge-response by public-key techniquesCustomized and zero-knowledge identification protocols Overview of zero-knowledge concepts Feige-Fiat-Shamir identification protocol GQ identification protocol Schnorr identification protocol Comparison: Fiat-Shamir, GQ, and SchnorrAttacks on identification protocolsNotes and further referencesDigital SignaturesIntroductionA framework for digital signature mechanisms Basic definitions Digital signatures schemes with appendix Digital signature schemes with message recovery Types of attacks on signature schemesRSA and related signature schemes The RSA signature scheme Possible attacks on RSA signatures RSA signatures in practice The Rabin public-key signature scheme ISO/lEC 9796 formatting PKCS #1 formattingFiat-Shamir signature schemes Feige-Fiat-Shamir signature scheme GQ signature schemeThe DSA and related signature schemes The Digital Signature Algorithm (DSA) The ElGamal signature scheme The generalized ElGamal signature scheme The Schnorr signature scheme The ElGamal signature scheme with message recoveryOne-time digital signatures The Rabin one-time signature scheme The Merkle one-time signature scheme Authentication trees and one-time signatures The GMR one-time signature schemeOther signature schemes Arbitrated digital signatures ESIGNSignatures with additional functionality Blind signature schemes Undeniable signature schemes Fail-stop signature schemesNotes and further referencesKey Establishment ProtocolsIntroductionClassification and framework General classification and fundamental concepts Objectives and properties Assumptions and adversaries in key establishment protocolsKey transport based on symmetric encryption Symmetric key transport and derivation without a server Kerberos and related server-based protocolsKey agreement based on symmetric techniquesKey transport based on public-key encryption Key transport using PK encryption without signatures Protocols combining PK encryption and signatures Hybrid key transport protocols using PK encryptionKey agreement based on asymmetric techniques Diffie-Hellman and related key agreement protocols Implicitly-certified public keys Diffie-Hellman protocols using implicitly certified keysSecret sharing Simple shared control schemes Threshold schemes Generalized secret sharingConference keyingAnalysis of key establishment protocols Attack strategies and classic protocol flaws Analysis objectives and methodsNotes and further referencesKey Management TechniquesIntroductionBackground and basic concepts Classifying keys by algorithm type and intended use Key management objectives, threats, and policy Simple key establishment models Roles of third parties Tradeoffs among key establishment protocolsTechniques for distributing confidential keys Key layering and cryptoperiods Key translation centers and symmetric-key certificatesTechniques for distributing public keys Authentication trees Public-key certificates Identity-based systems Implicitly certified public keys Comparison of techniques for distributing public keysTechniques for controlling key usage Key separation and constraints on key usage Techniques for controlling use of symmetric keysKey management involving multiple domains Trust between two domains Trust models involving multiple certification authorities Certificate distribution and revocationKey life cycle issues Lifetime protection requirements Key management life cycleAdvanced trusted third party services Trusted timestamping service Non-repudiation and notarization of digital signatures Key escrowNotes and further referencesEfficient ImplementationIntroductionMultiple-precision integer arithmetic Radix representation Addition and subtraction Multiplication Squaring DivisionMultiple-precision modular arithmetic Classical modular multiplication Montgomery reduction Barrett reduction Reduction methods for moduli of special formGreatest common divisor algorithms Binary gcd algorithm Lehmer's gcd algorithm Binary extended gcd algorithmChinese remainder theorem for integers Residue number systems Garner's algorithmExponentiation Basic techniques for exponentiation Fixed-exponent exponentiation algorithms Fixed-base exponentiation algorithmsExponent recoding Signed-digit representation String-replacement representationNotes and further referencesPatents and StandardsIntroductionPatents on cryptographic techniques Five fundamental patents Ten prominent patents Ten selected patents Ordering and acquiring patentsCryptographic standards International standards - cryptographic techniques Banking security standards (ANSI, ISO) International security architectures and frameworks U.S. government standards (FIPS) Industry standards and RFCs De facto standards Ordering and acquiring standardsNotes and further referencesA. Bibliography of Papers from Selected Cryptographic ForumsAsiacrypt/Auscrypt ProceedingsCrypto ProceedingsEurocrypt ProceedingsFast Software Encryption ProceedingsJournal of Cryptology papersReferencesIndex
Responsibility: Alfred J. Menezes ; Paul C. van Oorschot ; Scott A. Vanstone.


Editorial reviews

Publisher Synopsis

"...very well suited for the reader who wants an encyclopedic description of the state of the art of applied modern cryptography."-Mathematical Reviews, Issue 99g "[This book] is an incredible Read more...

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks 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.