MARC Record from marc_columbia

LEADER: 12677cam a2200733Ia 4500
001 15064840
005 20220618230928.0
006 m o d
007 cr cnu||||||||
008 040113s1997 flua obf 001 0 eng d
035 $a(OCoLC)ocm54016134
035 $a(NNC)15064840
040 $aWPG$beng$epn$cWPG$dOCLCG$dPUL$dOCLCQ$dOCLCF$dVVJ$dBAKER$dVLB$dZCU$dUIU$dTULIB$dYDXCP$dOCLCO$dOCLCQ$dCRCPR$dOCLCQ$dOCL$dCOO$dOCLCQ$dOCLCA$dUAB$dOCLCQ$dN$T$dERL$dNLE$dAU@$dUKMGB$dWYU$dYDX$dOCLCQ$dLEAUB$dOL$$dRDF$dFGM$dOCLCQ$dINARC$dZCU$dOCLCQ$dDINAT$dS2H$dVLB$dOCLCO$dUKAHL$dOCLCO
016 7 $a018428784$2Uk
019 $a61280420$a507201030$a702083228$a779914704$a1031054916$a1058122495$a1066017183$a1102539437$a1117093262$a1149180682
020 $a0849385237$q(electronic bk.)
020 $a9780849385230$q(electronic bk.)
020 $a9781439821916$q(electronic bk.)
020 $a1439821917$q(electronic bk.)
035 $a(OCoLC)54016134$z(OCoLC)61280420$z(OCoLC)507201030$z(OCoLC)702083228$z(OCoLC)779914704$z(OCoLC)1031054916$z(OCoLC)1058122495$z(OCoLC)1066017183$z(OCoLC)1102539437$z(OCoLC)1117093262$z(OCoLC)1149180682
037 $aTANDF_212076$bIngram Content Group
050 4 $aQA76.9.A25$bM463 1997eb
072 7 $aCOM$x083000$2bisacsh
082 04 $a005.8/2$220
049 $aZCUA
100 1 $aMenezes, A. J.$q(Alfred J.),$d1965-
245 10 $aHandbook of applied cryptography /$cAlfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone.
246 30 $aApplied cryptography
260 $aBoca Raton :$bCRC Press,$c©1997.
300 $a1 online resource (xxviii, 780 pages) :$billustrations
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
490 1 $aCRC Press series on discrete mathematics and its applications
504 $aIncludes bibliographical references (pages 703-754) and index.
505 0 $aRivest; 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,
505 0 $aAnd 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.
505 0 $aSpaces; 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.
505 0 $aIndividual 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,
505 0 $aSolovay-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.
505 0 $aPseudorandom 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.
505 0 $aAlgorithm; DES properties and strength; FEAL; IDEA; SAFER, RC5,
505 0 $aAnd 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.
505 0 $aHash 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.
505 0 $aMalicious 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.
505 0 $aProtocols; 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.
546 $aText in Tamil.
520 3 $aCryptography, 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 cryptographyIt is a valuable source of the latest techniques and algorithms for the serious practitionerIt provides an integrated treatment of the field, while still presenting each major topic as a self-contained unitIt provides a mathematical treatment to accompany practical discussionsIt contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussedNow 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.
650 0 $aComputers$xAccess control$vHandbooks, manuals, etc.
650 0 $aCryptography$vHandbooks, manuals, etc.
650 6 $aOrdinateurs$xAccès$xContrôle$vGuides, manuels, etc.
650 6 $aCryptographie$vGuides, manuels, etc.
650 7 $aCOMPUTERS$xSecurity$xCryptography.$2bisacsh
650 7 $aComputers$xAccess control.$2fast$0(OCoLC)fst00872779
650 7 $aCryptography.$2fast$0(OCoLC)fst00884552
655 0 $aElectronic books.
655 4 $aElectronic books.
655 7 $aHandbooks and manuals.$2fast$0(OCoLC)fst01423877
700 1 $aVan Oorschot, Paul C.
700 1 $aVanstone, Scott A.
776 08 $iPrint version:$aMenezes, A.J. (Alfred J.), 1965-$tHandbook of applied cryptography.$dBoca Raton : CRC Press, ©1997$z0849385237$w(DLC) 96027609$w(OCoLC)35292671
830 0 $aCRC Press series on discrete mathematics and its applications.
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15064840$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS