Book description
Written 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.
Table of contents
- Cover
- Half title page
- Title page
- Copyright page
- Dedication
- PREFACE
-
Part I: MATHEMATICAL PRELIMINARIES
-
CHAPTER 1 Counting
- 1.1 THE SUM AND PRODUCT RULES
- 1.2 MATHEMATICAL INDUCTION
- 1.3 FACTORIAL
- 1.4 BINOMIAL COEFFICIENTS
- 1.5 MULTINOMIAL COEFFICIENTS
- 1.6 PERMUTATIONS
- 1.7 COMBINATIONS
- 1.8 THE PRINCIPLE OF INCLUSION-EXCLUSION
- 1.9 PARTITIONS
- 1.10 RELATIONS
- 1.11 INVERSE RELATIONS
- APPENDIX 1 Summations Involving Binomial Coefficients
-
CHAPTER 2 Recurrence and Generating Functions
- 2.1 RECURSIONS
- 2.2 GENERATING FUNCTIONS
- 2.3 LINEAR CONSTANT COEFFICIENT RECURSIONS
- 2.4 SOLVING HOMOGENEOUS LCCRS USING GENERATING FUNCTIONS
- 2.5 THE CATALAN RECURSION
- 2.6 THE UMBRAL CALCULUS4
- 2.7 EXPONENTIAL GENERATING FUNCTIONS
- 2.8 PARTITIONS OF A SET: THE BELL AND STIRLING NUMBERS
- 2.9 ROUCHÉ’S THEOREM AND THE LAGRANGE’S INVERSION FORMULA
- CHAPTER 3 Asymptotic Analysis
-
CHAPTER 4 Discrete Probability Theory
- 4.1 THE ORIGINS OF PROBABILITY THEORY
- 4.2 CHANCE EXPERIMENTS, SAMPLE POINTS, SPACES, AND EVENTS
- 4.3 RANDOM VARIABLES
- 4.4 MOMENTS—EXPECTATION AND VARIANCE
- 4.5 THE BIRTHDAY PARADOX1
- 4.6 CONDITIONAL PROBABILITY AND INDEPENDENCE
- 4.7 THE LAW OF LARGE NUMBERS (LLN)
- 4.8 THE CENTRAL LIMIT THEOREM (CLT)
- 4.9 RANDOM PROCESSES AND MARKOV CHAINS
- CHAPTER 5 Number Theory and Modern Algebra
-
CHAPTER 6 Basic Concepts of Cryptography
- 6.1 THE LEXICON OF CRYPTOGRAPHY
- 6.2 STREAM CIPHERS
- 6.3 BLOCK CIPHERS
- 6.4 SECRECY SYSTEMS AND CRYPTANALYSIS
- 6.5 SYMMETRIC AND TWO-KEY CRYPTOGRAPHIC SYSTEMS
- 6.6 THE APPEARANCE OF PUBLIC KEY CRYPTOGRAPHIC SYSTEMS
- 6.7 A MULTITUDE OF KEYS
- 6.8 THE RSA CRYPTOSYSTEM
- 6.9 DOES PKC SOLVE THE PROBLEM OF KEY DISTRIBUTION?
- 6.10 ELLIPTIC GROUPS OVER THE REALS
- 6.11 ELLIPTIC GROUPS OVER THE FIELD Zm,2
- 6.12 ELLIPTIC GROUPS CRYPTOSYSTEMS
- 6.13 THE MENEZES-VANSTONE ELLIPTIC CURVE CRYPTOSYSTEM
- 6.14 SUPER SINGULAR ELLIPTIC CURVES
-
CHAPTER 1 Counting
-
Part II: HASHING FOR STORAGE: DATA MANAGEMENT
- CHAPTER 7 Basic Concepts
- CHAPTER 8 Hash Functions
- CHAPTER 9 Hashing Functions: Examples and Evaluation
-
CHAPTER 10 Record Chaining with Hash Tables
- 10.1 SEPARATE CHAINING OF RECORDS
- 10.2 ANALYSIS OF SEPARATE CHAINING HASHING SEQUENCES AND THE CHAINS THEY CREATE
- 10.3 A COMBINATORIAL ANALYSIS OF SEPARATE CHAINING
- 10.4 COALESCED CHAINING
- 10.5 THE PITTEL-YU ANALYSIS OF EICH COALESCED CHAINING
- 10.6 TO SEPARATE OR TO COALESCE; AND WHICH VERSION? THAT IS THE QUESTION
- CHAPTER 11 Perfect Hashing
- CHAPTER 12 The Uniform Hashing Model
-
CHAPTER 13 Hashing with Linear Probing
- 13.1 FORMULATION AND PRELIMINARIES
- 13.2 PERFORMANCE MEASURES FOR LP HASHING
- 13.3 ALL CELLS OTHER THAN HTn−1 IN THE HASH-TABLE OF n CELLS ARE OCCUPIED
- 13.4 m-KEYS HASHED INTO A HASH TABLE OF n CELLS LEAVING CELL HTn−1 UNOCCUPIED
- 13.5 THE PROBABILITY DISTRIBUTION FOR THE LENGTH OF A SEARCH
- 13.6 ASYMPTOTICS
- 13.7 HASHING WITH LINEAR OPEN ADDRESSING: CODA
- 13.8 A POSSIBLE IMPROVEMENT TO LINEAR PROBING
-
CHAPTER 14 Double Hashing
- 14.1 FORMULATION OF DOUBLE HASHING1
- 14.2 PROGRESSIONS AND STRIDES
- 14.3 THE NUMBER OF PROGRESSIONS WHICH FILL A HASH-TABLE CELL
- 14.4 DOMINANCE
- 14.5 INSERTION-COST BOUNDS RELATING UNIFORM AND DOUBLE HASHING
- 14.6 USUALLYDOUBLEHASH
- 14.7 THE UDH CHANCE EXPERIMENT AND THE COST TO INSERT THE NEXT KEY BY DOUBLE HASHING
- 14.8 PROOF OF EQUATION (14.12a)
- 14.9 USUALLYDOUBLEHASH′
- 14.10 PROOF OF EQUATION (14.12b)
- CHAPTER 15 Optimum Hashing
-
Part III: SOME NOVEL APPLICATIONS OF HASHING
-
CHAPTER 16 Karp-Rabin String Searching
- 16.1 OVERVIEW
- 16.2 THE BASIC KARP-RABIN HASH-FINGERPRINT ALGORITHM
- 16.3 THE PLAIN VANILLA KARP-RABIN FINGERPRINT ALGORITHM
- 16.4 SOME ESTIMATES ON PRIME NUMBERS
- 16.5 THE COST OF FALSE MATCHES IN THE PLAIN VANILLA KARP-RABIN FINGERPRINT ALGORITHM
- 16.6 VARIATIONS ON THE PLAIN VANILLA KARP-RABIN FINGERPRINT ALGORITHM
- 16.7 A NONHASHING KARP-RABIN FINGERPRINT
- CHAPTER 17 Hashing Rock and Roll
-
CHAPTER 18 Hashing in E-Commerce
- 18.1 THE VARIED APPLICATIONS OF CRYPTOGRAPHY
- 18.2 AUTHENTICATION
- 18.3 THE NEED FOR CERTIFICATES
- 18.4 CRYPTOGRAPHIC HASH FUNCTIONS
- 18.5 X.509 CERTIFICATES AND CCIT STANDARDIZATION
- 18.6 THE SECURE SOCKET LAYER (SSL)
- 18.7 TRUST ON THE WEB · · · TRUST NO ONE OVER 40!
- 18.8 MD5
- 18.9 CRITICISM OF MD5
- 18.10 THE WANG-YU COLLISION ATTACK
- 18.11 STEVEN’S IMPROVEMENT TO THE WANG-YU COLLISION ATTACK
- 18.12 THE CHOSEN-PREFIX ATTACK ON MD5
- 18.13 THE ROGUE CA ATTACK SCENARIO
- 18.14 THE SECURE HASH ALGORITHMS
- 18.15 CRITICISM OF SHA-1
- 18.16 SHA-2
- 18.17 WHAT NOW?
- APPENDIX 18 Sketch of the Steven’s Chosen Prefix Attack
- A18.1 BIRTHDAYING1 [SCHNEIER 1996, PP. 165–166], [OORSCHOT AND WIENER 1999]
- A18.2 THE BINARY SIGNED DIGIT REPRESENTATION (BSDR)
- A18.3 DIFFERENTIAL ANALYSIS
- A18.4 OUTLINE OF THE STEVENS CONSTRUCTION
-
CHAPTER 19 Hashing and the Secure Distribution of Digital Media
- 19.1 OVERVIEW
- 19.2 INTELLECTUAL PROPERTY (COPYRIGHTS AND PATENTS)
- 19.3 STEGANOGRAPHY
- 19.4 BOIL, BOIL, TOIL AND · · · BUT FIRST, CAREFULLY MIX
- 19.5 SOFTWARE DISTRIBUTION SYSTEMS
- 19.6 WATERMARKS
- 19.7 AN IMAGE-PROCESSING TECHNIQUE FOR WATERMARKING
- 19.8 USING GEOMETRIC HASHING TO WATERMARK IMAGES
- 19.9 BIOMETRICS AND HASHING
- 19.10 THE DONGLE24
- APPENDIX 19 Reed-Solomon and Hadamard Coding
- A.19.0 CODES
- A.19.1 REED-SOLOMON CODES
- A.19.3 HADAMARD CODES
-
CHAPTER 16 Karp-Rabin String Searching
- Exercises and Solutions
- Index
Product information
- Title: Hashing in Computer Science: Fifty Years of Slicing and Dicing
- Author(s):
- Release date: July 2010
- Publisher(s): Wiley-Interscience
- ISBN: 9780470344736
You might also like
book
Verification of Systems and Circuits Using LOTOS, Petri Nets, and CCS
A Step-by-Step Guide to Verification of Digital Systems This practical book provides a step-by-step, interactive introduction …
book
Distributed Computing Through Combinatorial Topology
Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial …
book
Boost.Asio C++ Network Programming Cookbook
Over 25 hands-on recipes to create robust and highly-efficient cross-platform distributed applications with the Boost.Asio libraryAbout …
book
Digital Systems Design with FPGAs and CPLDs
Digital Systems Design with FPGAs and CPLDs explains how to design and develop digital electronic systems …