Handbook of Applied Cryptography (inbunden)
Inbunden (Hardback)
Antal sidor
CRC Press Inc
104 black & white tables
104 Tables, black and white
265 x 185 x 50 mm
1620 g
Antal komponenter
Contains 6 Hardbacks
Handbook of Applied Cryptography (inbunden)

Handbook of Applied Cryptography

Inbunden, Engelska, 1996-10-01
Skickas inom 3-6 vardagar.
Fri frakt inom Sverige för privatpersoner.
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography. The Handbook of Applied Cryptography provides a treatment that is multifunctional: It serves as an introduction to the more practical aspects of both conventional and public-key cryptography It is a valuable source of the latest techniques and algorithms for the serious practitioner It provides an integrated treatment of the field, while still presenting each major topic as a self-contained unit It provides a mathematical treatment to accompany practical discussions It contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussed Now in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.
Visa hela texten

Passar bra ihop

  1. Handbook of Applied Cryptography
  2. +
  3. Guide to Elliptic Curve Cryptography


Har du läst boken? Sätt ditt betyg »

Recensioner i media

"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 achievement. [T]he handbook is complete. If I want to check what problems there were with a proposed system, determine how the variations on a particular algorithm developed, see what research preceded and followed an idea, I go to the Handbook. The Handbook has accurate, clear, and correct information. It is wonderful. If I were limited to only one cryptography text on my shelves, it would be the Handbook of Applied Cryptography." - Bulletin of the AMS

Bloggat om Handbook of Applied Cryptography


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 universa