{"product_id":"hashing-in-computer-science-9780470344736","title":"Hashing in Computer Science","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003eWritten by one of the developers of the technology, Hashing is both a historical document on the development of hashing and an analysis of the applications of hashing in a society increasingly concerned with security. The material in this book is based on courses taught by the author, and key points are reinforced in sample problems and an accompanying instructor s manual. Graduate students and researchers in mathematics, cryptography, and security will benefit from this overview of hashing and the complicated mathematics that it requires.\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTrade Review\u003c\/b\u003e\u003cbr\u003e\"Graduate students and researchers in mathematics, cryptography, and security will benefit from this overview of hashing and the complicated mathematics that it requires.\" (Forums Digital Media Net, 27 October 2010)\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTable of Contents\u003c\/b\u003e\u003cbr\u003ePREFACE.  \u003cp\u003e\u003cb\u003ePART I: MATHEMATICAL PRELIMINARIES.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1. Counting.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1: The Sum and Product Rules.\u003c\/p\u003e \u003cp\u003e1.2: Mathematical Induction.\u003c\/p\u003e \u003cp\u003e1.3: Factorial.\u003c\/p\u003e \u003cp\u003e1.4: Binomial Coefficients.\u003c\/p\u003e \u003cp\u003e1.5: Multinomial Coefficients.\u003c\/p\u003e \u003cp\u003e1.6: Permutations.\u003c\/p\u003e \u003cp\u003e1.7: Combinations.\u003c\/p\u003e \u003cp\u003e1.8: The Principle of Inclusion-Exclusion.\u003c\/p\u003e \u003cp\u003e1.9: Partitions.\u003c\/p\u003e \u003cp\u003e1.10: Relations.\u003c\/p\u003e \u003cp\u003e1.11: Inverse Relations.\u003c\/p\u003e \u003cp\u003eAppendix 1: Summations Involving Binomial Coefficients.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2. Recurrence and Generating Functions.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1: Recursions.\u003c\/p\u003e \u003cp\u003e2.2: Generating Functions.\u003c\/p\u003e \u003cp\u003e2.3: Linear Constant Coefficient Recursions.\u003c\/p\u003e \u003cp\u003e2.4: Solving Homogeneous LCCRs Using Generating Functions.\u003c\/p\u003e \u003cp\u003e2.5: The Catalan Recursion.\u003c\/p\u003e \u003cp\u003e2.6: The Umbral Calculus.\u003c\/p\u003e \u003cp\u003e2.7: Exponential Generating Functions.\u003c\/p\u003e \u003cp\u003e2.8: Partitions of a Set: The Bell and Stirling Numbers.\u003c\/p\u003e \u003cp\u003e2.9: Rouché’s Theorem and the Lagrange’s Inversion Formula.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3. Asymptotic Analysis.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1: Growth Notation for Sequences.\u003c\/p\u003e \u003cp\u003e3.2: Asymptotic Sequences and Expansions.\u003c\/p\u003e \u003cp\u003e3.3: Saddle Points.\u003c\/p\u003e \u003cp\u003e3.4: Laplace’s Method.\u003c\/p\u003e \u003cp\u003e3.5: The Saddle Point Method.\u003c\/p\u003e \u003cp\u003e3.6: When Will the Saddle Point Method Work?\u003c\/p\u003e \u003cp\u003e3.7: The Saddle Point Bounds.\u003c\/p\u003e \u003cp\u003e3.8: Examples of Saddle Point Analysis.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4. Discrete Probability Theory.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1: The Origins of Probability Theory.\u003c\/p\u003e \u003cp\u003e4.2: Chance Experiments, Sample Points, Spaces, and Events.\u003c\/p\u003e \u003cp\u003e4.3: Random Variables.\u003c\/p\u003e \u003cp\u003e4.4: Moments—Expectation and Variance.\u003c\/p\u003e \u003cp\u003e4.5: The Birthday Paradox.\u003c\/p\u003e \u003cp\u003e4.6: Conditional Probability and Independence.\u003c\/p\u003e \u003cp\u003e4.7: The Law of Large Numbers (LLN).\u003c\/p\u003e \u003cp\u003e4.8: The Central Limit Theorem (CLT).\u003c\/p\u003e \u003cp\u003e4.9: Random Processes and Markov Chains.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5. Number Theory and Modern Algebra.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1: Prime Numbers.\u003c\/p\u003e \u003cp\u003e5.2: Modular Arithmetic and the Euclidean Algorithm.\u003c\/p\u003e \u003cp\u003e5.3: Modular Multiplication.\u003c\/p\u003e \u003cp\u003e5.4: The Theorems of Fermat and Euler.\u003c\/p\u003e \u003cp\u003e5.5: Fields and Extension Fields.\u003c\/p\u003e \u003cp\u003e5.6: Factorization of Integers.\u003c\/p\u003e \u003cp\u003e5.7: Testing Primality.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6. Basic Concepts of Cryptography.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1: The Lexicon of Cryptography.\u003c\/p\u003e \u003cp\u003e6.2: Stream Ciphers.\u003c\/p\u003e \u003cp\u003e6.3: Block Ciphers.\u003c\/p\u003e \u003cp\u003e6.4: Secrecy Systems and Cryptanalysis.\u003c\/p\u003e \u003cp\u003e6.5: Symmetric and Two-Key Cryptographic Systems.\u003c\/p\u003e \u003cp\u003e6.6: The Appearance of Public Key Cryptographic systems.\u003c\/p\u003e \u003cp\u003e6.7: A Multitude of Keys.\u003c\/p\u003e \u003cp\u003e6.8: The RSA Cryptosystem.\u003c\/p\u003e \u003cp\u003e6.9: Does PKC Solve the Problem of Key Distribution?\u003c\/p\u003e \u003cp\u003e6.10: Elliptic Groups Over the Reals.\u003c\/p\u003e \u003cp\u003e6.11: Elliptic Groups Over the Field Z\u003csub\u003e\u003ci\u003em\u003c\/i\u003e,2 .\u003c\/sub\u003e\u003c\/p\u003e \u003cp\u003e\u003csub\u003e6.12: Elliptic Group Cryptosystems.\u003c\/sub\u003e\u003c\/p\u003e \u003cp\u003e6.13: The Menezes-Vanstone Elliptic Curve Cryptosystem.\u003c\/p\u003e \u003cp\u003e6.14: Super-Singular Elliptic Curves.\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePART II: HASHING FOR STORAGE: DATA MANAGEMENT.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7. Basic Concepts.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1: Overview of the Records Management Problem.\u003c\/p\u003e \u003cp\u003e7.2: A Simple Storage Management Protocol: Plain Vanilla Chaining.\u003c\/p\u003e \u003cp\u003e7.3: Record-Management with Sorted Keys.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8. Hash Functions.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1: The Origin of Hashing.\u003c\/p\u003e \u003cp\u003e8.2: Hash Tables.\u003c\/p\u003e \u003cp\u003e8.3: A Statistical Model for Hashing.\u003c\/p\u003e \u003cp\u003e8.4: The Likelihood of Collisions.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9. Hashing Functions: Examples and Evaluation.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1: Overview: The Tradeoff of Randomization Versus Computational Simplicity.\u003c\/p\u003e \u003cp\u003e9.2: Some Examples of Hashing Functions.\u003c\/p\u003e \u003cp\u003e9.3: Performance of Hash Functions: Formulation.\u003c\/p\u003e \u003cp\u003e9.4: The X\u003csup\u003e2\u003c\/sup\u003e-Test.\u003c\/p\u003e \u003cp\u003e9.5: Testing a Hash Function.\u003c\/p\u003e \u003cp\u003e9.6: The McKenzie et al. Results.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10. Record Chaining with Hash Tables.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1: Separate Chaining of Records.\u003c\/p\u003e \u003cp\u003e10.2: Analysis of Separate Chaining Hashing Sequences and the Chains They Create.\u003c\/p\u003e \u003cp\u003e10.3: A Combinatorial Analysis of Separate Chaining.\u003c\/p\u003e \u003cp\u003e10.4: Coalesced Chaining.\u003c\/p\u003e \u003cp\u003e10.5: The Pittel-Yu Analysis of EICH Coalesced Chaining.\u003c\/p\u003e \u003cp\u003e10.6: To Separate or to Coalesce; and Which Version? That Is the Question.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e11. Perfect Hashing.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e11.1: Overview.\u003c\/p\u003e \u003cp\u003e11.2: Chichelli’s Construction.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e12. The Uniform Hashing Model.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e12.1: An Idealized Hashing Model.\u003c\/p\u003e \u003cp\u003e12.2: The Asymptotics of Uniform Hashing.\u003c\/p\u003e \u003cp\u003e12.3: Collision-Free Hashing.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e13. Hashing with Linear Probing.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e13.1: Formulation and Preliminaries.\u003c\/p\u003e \u003cp\u003e13.2: Performance Measures for LP Hashing.\u003c\/p\u003e \u003cp\u003e13.3: All Cells Other than HT\u003csub\u003e\u003ci\u003en\u003c\/i\u003e-1\u003c\/sub\u003e in the Hash-Table of \u003ci\u003en\u003c\/i\u003e Cells are Occupied.\u003c\/p\u003e \u003cp\u003e13.4: \u003ci\u003em\u003c\/i\u003e-Keys Hashed into a Hash Table of \u003ci\u003en\u003c\/i\u003e Cells Leaving Cell HT\u003csub\u003e\u003ci\u003en\u003c\/i\u003e-1\u003c\/sub\u003e Unoccupied.\u003c\/p\u003e \u003cp\u003e13.5: The Probability Distribution for the Length of a Search.\u003c\/p\u003e \u003cp\u003e13.6: Asymptotics.\u003c\/p\u003e \u003cp\u003e13.7: Hashing with Linear Open Addressing: Coda.\u003c\/p\u003e \u003cp\u003e13.8: A Possible Improvement to Linear Probing.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e14. Double Hashing.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e14.1: Formulation of Double Hashing.\u003c\/p\u003e \u003cp\u003e14.2: Progressions and Strides.\u003c\/p\u003e \u003cp\u003e14.3: The Number of Progressions Which Fill a Hash-Table Cell.\u003c\/p\u003e \u003cp\u003e14.3.1: Progression Graphs.\u003c\/p\u003e \u003cp\u003e14.4: Dominance.\u003c\/p\u003e \u003cp\u003e14.5: Insertion-Cost Bounds Relating Uniform and Double Hashing.\u003c\/p\u003e \u003cp\u003e14.6: UsuallyDoubleHash.\u003c\/p\u003e \u003cp\u003e14.7: The UDH Chance Experiment and the Cost to Insert the Next Key by Double Hashing.\u003c\/p\u003e \u003cp\u003e14.8: Proof of Equation (14.12\u003ci\u003ea\u003c\/i\u003e).\u003c\/p\u003e \u003cp\u003e14.9: UsuallyDoubleHash.\u003c\/p\u003e \u003cp\u003e14.10: Proof of Equation (14.12\u003ci\u003eb\u003c\/i\u003e).\u003c\/p\u003e \u003cp\u003e\u003cb\u003e15. Optimum Hashing.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e15.1: The Ullman–Yao Framework.\u003c\/p\u003e \u003cp\u003e15.1.1: The Ullman–Yao Hashing Functions.\u003c\/p\u003e \u003cp\u003e15.1.2: Ullman–Yao INSERT(k) and SEARCH(k).\u003c\/p\u003e \u003cp\u003e15.1.3: The Ullman–Yao Statistical Model.\u003c\/p\u003e \u003cp\u003e15.2: The Rates at Which a Cell is Probed and Occupied.\u003c\/p\u003e \u003cp\u003e15.3: Partitions of \u003csub\u003e(\u003ci\u003ei\u003c\/i\u003e)\u003c\/sub\u003eScenarios, \u003csub\u003e(\u003ci\u003ei\u003c\/i\u003e)\u003c\/sub\u003eSubscenarios, and Their Skeletons.\u003c\/p\u003e \u003cp\u003e15.3.1: \u003csub\u003e(\u003ci\u003ei\u003c\/i\u003e)\u003c\/sub\u003eSubscenarios.\u003c\/p\u003e \u003cp\u003e15.3.2: Skeletons.\u003c\/p\u003e \u003cp\u003e15.4: Randomly Generated \u003ci\u003em\u003c\/i\u003e-Scenarios.\u003c\/p\u003e \u003cp\u003e15.5: Bounds on Random Sums.\u003c\/p\u003e \u003cp\u003e15.6: Completing the Proof of Theorem 15.1.\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePART III: SOME NOVEL APPLICATIONS OF HASHING.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003e16. Karp-Rabin String Searching.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e16.1: Overview.\u003c\/p\u003e \u003cp\u003e16.2: The Basic Karp-Rabin Hash-Fingerprint Algorithm.\u003c\/p\u003e \u003cp\u003e16.3: The Plain Vanilla Karp-Rabin Fingerprint Algorithm.\u003c\/p\u003e \u003cp\u003e16.4: Some Estimates on Prime Numbers.\u003c\/p\u003e \u003cp\u003e16.5: The Cost of False Matches in the Plain Vanilla Karp-Rabin Fingerprint Algorithm.\u003c\/p\u003e \u003cp\u003e16.6: Variations on the Plain Vanilla Karp-Rabin Fingerprint Algorithm.\u003c\/p\u003e \u003cp\u003e16.7: A Nonhashing Karp-Rabin Fingerprint.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e17. Hashing Rock and Roll.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e17.1: Overview of Audio Fingerprinting .\u003c\/p\u003e \u003cp\u003e17.2: The Basics of Fingerprinting Music.\u003c\/p\u003e \u003cp\u003e17.3: Haar Wavelet Coding.\u003c\/p\u003e \u003cp\u003e17.4: Min-Hash.\u003c\/p\u003e \u003cp\u003e17.5: Some Commercial Fingerprinting Products.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e18. Hashing in E-Commerce.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e18.1: The Varied Applications of Cryptography.\u003c\/p\u003e \u003cp\u003e18.2: Authentication.\u003c\/p\u003e \u003cp\u003e18.3: The Need for Certificates.\u003c\/p\u003e \u003cp\u003e18.4: Cryptographic Hash Functions.\u003c\/p\u003e \u003cp\u003e18.5: X.509 Certificates and CCIT Standardization.\u003c\/p\u003e \u003cp\u003e18.6: The Secure Socket Layer (SSL).\u003c\/p\u003e \u003cp\u003e18.7: Trust on the Web ... Trust No One Over 40!\u003c\/p\u003e \u003cp\u003e18.8: MD5.\u003c\/p\u003e \u003cp\u003e18.9: Criticism of MD5.\u003c\/p\u003e \u003cp\u003e18.10: The Wang-Yu Collision Attack.\u003c\/p\u003e \u003cp\u003e18.11: Steven’s Improvement to the Wang-Yu Collision Attack.\u003c\/p\u003e \u003cp\u003e18.12: The Chosen-Prefix Attack on MD5.\u003c\/p\u003e \u003cp\u003e18.13: The Rogue CA Attack Scenario.\u003c\/p\u003e \u003cp\u003e18.14: The Secure Hash Algorithms.\u003c\/p\u003e \u003cp\u003e18.15: Criticism of SHA-1.\u003c\/p\u003e \u003cp\u003e18.16: SHA-2.\u003c\/p\u003e \u003cp\u003e18.17: What Now?\u003c\/p\u003e \u003cp\u003eAppendix 18: Sketch of the Steven’s Chosen Prefix Attack.\u003c\/p\u003e \u003cp\u003e\u003cb\u003e19. Hashing and the Secure Distribution of Digital Media.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e19.1: Overview.\u003c\/p\u003e \u003cp\u003e19.2: Intellectual Property (Copyrights and Patents).\u003c\/p\u003e \u003cp\u003e19.3: Steganography.\u003c\/p\u003e \u003cp\u003e19.4: Boil, Boil, Toil ... and But First, Carefully Mix.\u003c\/p\u003e \u003cp\u003e19.5: Software Distribution Systems.\u003c\/p\u003e \u003cp\u003e19.6: Watermarks.\u003c\/p\u003e \u003cp\u003e19.7: An Image-Processing Technique for Watermarking.\u003c\/p\u003e \u003cp\u003e19.8: Using Geometric Hashing to Watermark Images.\u003c\/p\u003e \u003cp\u003e19.9: Biometrics and Hashing.\u003c\/p\u003e \u003cp\u003e19.10: The Dongle.\u003c\/p\u003e \u003cp\u003eAppendix 19: Reed-Solomon and Hadamard Coding.\u003c\/p\u003e \u003cp\u003e\u003cb\u003eExercises and Solutions.\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eINDEX.\u003c\/b\u003e\u003c\/p\u003e","brand":"Wiley","offers":[{"title":"Default Title","offer_id":53515416207703,"sku":"9780470344736","price":119.65,"currency_code":"GBP","in_stock":true}],"url":"https:\/\/bookcurl.com\/products\/hashing-in-computer-science-9780470344736","provider":"Book Curl","version":"1.0","type":"link"}