Handbook of applied cryptography. (©1997)

• Record Type: Book
• Other Titles: Applied cryptography
• Further Information: Note: Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone.
• Other Names: Menezes, A. J (Alfred J.), 1965-; Van Oorschot, Paul C; Vanstone, Scott A
• Contents: Foreword by Ronald L. Rivest; Overview of Cryptography; Introduction; Information security and cryptography; Background on functions; Functions(1-1, one-way, trapdoor one-way); Permutations; Involutions; Basic terminology and concepts; Symmetric-key encryption; Overview of block ciphers and stream ciphers; Substitution ciphers and transposition ciphers; Composition of ciphers; Stream ciphers; The key space; Digital signatures; Authentication and identification; Identification; Data origin authentication; Public-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 cryptography; Hash functions; Protocols and mechanisms; Key establishment, management, and certification; Key management through symmetric-key techniques; Key management through public-key techniques; Trusted third parties and public-key certificates; Pseudorandom numbers and sequences; Classes of attacks and security models; Attacks on encryption schemes; Attacks on protocols; Models for evaluating security; Perspective for computational security; Notes and further references; Mathematical Background; Probability theory; Basic definitions; Conditional probability; Random variables; Binomial distribution; Birthday attacks; Random mappings; Information theory; Entropy; Mutual information; Complexity theory; Basic definitions; Asymptotic notation; Complexity classes; Randomized algorithms; Number theory; The integers; Algorithms in Z; The integers modulo n; Algorithms in Zn; The Legendre and Jacobi symbols; Blum integers; Abstract algebra; Groups; Rings; Fields; Polynomial rings; Vector spaces; Finite fields; Basic properties; The Euclidean algorithm for polynomials; Arithmetic of polynomials; Notes and further references; Number-Theoretic Reference Problems; Introduction and overview; The 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 factoring; The RSA problem; The quadratic residuosity problem; Computing square roots in Zn; Case (i): n prime; Case (ii): n composite; The 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*p; The Diffie-Hellman problem; Composite moduli; Computing individual bits; The discrete logarithm problem in Z*p - individual bits; The RSA problem - individual bits; The Rabin problem - individual bits; The subset sum problem; The L3-Iattice basis reduction algorithm; Solving subset sum problems of low density; Simultaneous diophantine approximation; Factoring polynomials over finite fields; Square-free factorization; Beriekamp's Q-matrix algorithm; Notes and further references; Public-Key Parameters; Introduction; Generating large prime numbers naively; Distribution of prime numbers; Probabilistic 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 curves; Prime number generation; Random search for probable primes; Strong primes; NIST method for generating DSA primes; Constructive techniques for provable primes; Irreducible polynomials over Zp; Irreducible polynomials; Irreducible trinomials; Primitive polynomials; Generators and elements of high order; Selecting a prime p and generator of Z*p; Notes and further references; Pseudorandom Bits and Sequences; Introduction; Classification and framework; Random bit generation; Pseudorandom bit generation; ANSI X9.17; FIPS 186; Statistical tests; The normal and chi-square distributions; Hypothesis testing; Golomb's randomness postulates; Five basic tests; Maurer's universal statistical test; Cryptographically secure pseudorandom bit generation; RSA pseudorandom bit generator; Blum-Blum-Shub pseudorandom bit generator; Notes and further references; Stream Ciphers; Introduction; Classification; Feedback shift registers; Linear feedback shift registers; Linear complexity; Berlekamp-Massey algorithm; Nonlinear feedback shift registers; Stream ciphers based on LFSRs; Nonlinear combination generators; Nonlinear filter generators; Clock-controlled generators; Other stream ciphers; SEAL; Notes and further references; Block Ciphers; Introduction and overview; Background and general concepts; Introduction to block ciphers; Modes of operation; Exhaustive key search and multiple encryption; Classical ciphers and historical development; Transposition ciphers; Substitution ciphers; Polyalphabetic substitutions and Vigenère ciphers; Polyalphabetic cipher machines and rotors (historical); Cryptanalysis of classical ciphers; DES; Product ciphers and Feistel ciphers; DES algorithm; DES properties and strength; FEAL; IDEA; SAFER, RC5, and other block ciphers; SAFER; RC5; Other block ciphers; Notes and further references; Public-Key Encryption; Introduction; Basic principles; RSA public-key encryption; Description; Security of RSA; RSA encryption in practice; Rabin public-key encryption; ElGamal public-key encryption; Basic ElGamal encryption; Generalized ElGamal encryption; McEliece public-key encryption; Knapsack public-key encryption; Merkle-Hellman knapsack encryption; Chor-Rivest knapsack encryption; Probabilistic public-key encryption; Goldwasser-Micali probabilistic encryption; Blum-Goldwasser probabilistic encryption; Plaintext-aware encryption; Notes and further references; Hash Functions and Data Integrity; Introduction; Classification 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 applications; Basic 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 security; Unkeyed hash functions (MDCs); Hash functions based on block ciphers; Customized hash functions based on MD4; Hash functions based on modular arithmetic; Keyed hash functions (MACS); MACs based on block ciphers; Constructing MACs from MDCs; Customized MACs; MACs for stream ciphers; Data 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 encryption; Advanced attacks on hash functions; Birthday attacks; Pseudo-collisions and compression function attacks; Chaining attacks; Attacks based on properties of underlying cipher; Notes and further references; Identification and Entity Authentication; Introduction; Identification objectives and applications; Properties of identification protocols; Passwords (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 techniques; Customized 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 Schnorr; Attacks on identification protocols<B
• Publisher Details: Boca Raton : CRC Press
• Publication Date: 1997
• Copyright Date: 1997
• Extent: 1 online resource (xxviii, 780 pages), illustrations
• Subjects: 005.8/2; Computers -- Access control -- Handbooks, manuals, etc; Cryptography -- Handbooks, manuals, etc; Computers -- Access control -- Handbooks, manuals, etc; Cryptography -- Handbooks, manuals, etc; Computers -- Access control; Cryptography; Electronic books; Handbooks and manuals
• Languages: English
• ISBNs: 0849385237; 9780849385230; 0849385237; 9781439821916; 1439821917
• Notes: Note: Includes bibliographical references (pages 703-754) and index.
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.