Library Hours
Monday to Friday: 9 a.m. to 9 p.m.
Saturday: 9 a.m. to 5 p.m.
Sunday: 1 p.m. to 9 p.m.
Naper Blvd. 1 p.m. to 5 p.m.
     
Results Page:  Previous Next
Author Konheim, Alan G., 1934-

Title Hashing in computer science : fifty years of slicing and dicing / Alan G. Konheim. [O'Reilly electronic resource]

Imprint Hoboken, N.J. : Wiley, ©2010.
QR Code
Description 1 online resource (xvii, 386 pages) : illustrations
data file rda
Bibliography
Bibliography Includes bibliographical references and index.
Contents pt. 1. Mathematical preliminaries -- pt. 2. Hashing for storage : data management -- pt. 3. Some novel applications of hashing.
Summary 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.
Subject Hashing (Computer science)
Cryptography.
Data encryption (Computer science)
Computer security.
Adressage calculé (Informatique)
Cryptographie.
Chiffrement (Informatique)
Sécurité informatique.
Computer security
Cryptography
Data encryption (Computer science)
Hashing (Computer science)
Other Form: Print version: Konheim, Alan G., 1934- Hashing in computer science. Hoboken, N.J. : John Wiley & Sons, 2010 (DLC) 2009052123 (OCoLC)496160007
ISBN 9780470630600 (electronic bk.)
0470630604 (electronic bk.)
9780470630617 (electronic bk.)
0470630612 (electronic bk.)
9781118031834
1118031830
1282686275
9781282686274
Patron reviews: add a review
Click for more information
EBOOK
No one has rated this material

You can...
Also...
- Find similar reads
- Add a review
- Sign-up for Newsletter
- Suggest a purchase
- Can't find what you want?
More Information