- Series: Discrete Mathematics and Its Applications
- Hardcover: 780 pages
- Publisher: CRC Press; 1 edition (October 16, 1996)
- Language: English
- ISBN-10: 0849385237
- ISBN-13: 978-0849385230
- Product Dimensions: 7 x 1.7 x 10 inches
- Shipping Weight: 3.4 pounds (View shipping rates and policies)
- Average Customer Review: 4.1 out of 5 stars See all reviews (26 customer reviews)
- Amazon Best Sellers Rank: #207,181 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Handbook of Applied Cryptography (Discrete Mathematics and Its Applications) 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
Frequently Bought Together
Customers Who Bought This Item Also Bought
Top Customer Reviews
to neglect this book.
We used this in a course, and even though it's a handbook, it doubles up
pretty well as a textbook, since it has all the underlying mathematical
theory, presented in a clear and concise manner.
For sheer breadth and depth of coverage, this book is unmatched in the
field. It may not have enough on some topics to satisfy everyone, but
then i suspect most such topics were not so prominent in 1996, which
is when the book was written.
Starting with number theory, it goes on cover pseudorandom bits and
sequences, stream and block ciphers, hash functions, and digital signatures,
establishment protocols, implementation, patents and standards - you name
it, you got it.
On the one hand, there's enough theory to make you wonder whether it
should be called 'applied', but then it indeed qualifies as implementations
are discussed as well.
And of course, there's an exhaustive bibliography, with more pointers to
the literature than one could possibly follow up.
One word of caution, though : it requires hard work. If you want a more
'relaxed' coverage of comparable breadth (but not depth), you can do
worse than look up Bruce Schneier's 'Applied Crypography', which is a
delightful read, but nowhere as rigorous (read academic) as this one.
All in all, this is an indispensable reference for those in the field -
rigorous and exhaustive, yet eminently readable.
If you still haven't made your mind up, here's one final piece of advice :
visit the authors'(rather the book's) website, where you'll get the
implementations of all the algorithms in the book, and a (presumably)
pleasant surprise :-)
If you don't have a ton of mathematical background and are scared of having to take a crash course in number theory, or are looking for a higher level view of things, I'd suggest something more along the lines of Bruce Schneier's 'Applied Cryptography' (ASIN 0471117099). If you have some mathematical background, but want to get into things in detail, this is probably for you.
If you're not sure whether you'll like the book, you should definitely take a look at it. While Amazon currently doesn't have sample pages, if you do a Web Search on "Handbook of Applied Cryptography", you can find Sample Chapters hosted online to give you a good feel for the book's style.
The second chapter provides a concise review of probability theory, information theory, complexity theory, and number theory. This chapter would be helpful to anyone in computer science who already has some discrete math background. For readers with no discrete math background I would recommend first reading "Discrete Mathematics and Its Applications" by Kenneth Rosen, the editor of the series this book belongs to.
The coverage of number-theoretic problems in chapter 3 is very easy to follow and provides a handy reference to the average case performance of the best known algorithms for each.
The next few chapters are very math-intensive and outline the most common encryption algorithms and standards with examples. The chapter on block ciphers includes a section on classical ciphers and cryptanalysis which, as a sidenote, might be of interest to students of linguistics.
The later chapters present protocols for authentication, digital signing, and key management which build on the algorithms of the previous chapters, but can be understood independently.
One of the final chapters presents methods of effecient computation which again would be useful to anyone in computer science, not just those who are interested in cryptography.
Overall, the development of the topics in the book is complete (although by no means rigorous) and concise, including examples only where necessary. I highly recommend this book to students who want to learn more about cryptography, anyone whose job requires some knowledge of standards for authentication, digital signing, etc., such as internet security, and any computer scientist who has an academic interest in algorithms and their applications.
The print quality is terrible; like a fourth generation photocopy. Paper is thin, cheap and allows significant bleed-through. Also, print has significant over-spray like a cheap ink-jet printer. The authors have written an excellent book. It is difficult for me to describe the printer without resorting to four letter words. You should consider by the electronic version in PDF's rather than a print copy.
If you want to learn about the number theory behind public key cryptography this book provides the best roadmap.
Most Recent Customer Reviews
I owned previous editions of this book and consider it as a must have.
However, the book I received was printed very badly and the text / formulae are blurry...Read more
Sometimes it's hard to read - so many noise dots around the text.
This book is firstly an e-gift/giFt to XKW Lee the informist in year 1999, then now in June 2013 a paper copy will become both a present & a...Read more