| |
|
Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition 99 reviews Bruce Schneier
Wiley, 1996
Dated but indespensible
+ A Classic Cryptography Bible + The unique and original applied cryptography book! + Easy to read, perfect level of detail. + Excellent Introduction
|
|
|
|
|
|
| |
|
An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) 7 reviews Ming Li, Paul Vitanyi
Springer, 1997
Biggest return for the biggest investment
+ A must + Excellent if you have the math... + The only one of its kind.... + Comprehensive and Excellent
|
|
|
|
|
|
| |
|
Theory of Computational Complexity 2 reviews Ding-Zhu Du, Ker-I Ko
Wiley-Interscience, 2000
Terrible
My pity goes out to those unfortunate enough to take a course using this book. Aside from being nearly inscrutable, this text is also incorrect in many places. Exercises range from trivial to nearly impossible, with no indication of which is which. Proofs are verbose with little indication of the ...
|
|
|
|
|
|
| |
|
The Latex Companion (Addison-Wesley Series on Tools and Techniques for Computer T) 20 reviews Michel Goossens, Frank Mittelbach, ...
Addison-Wesley Professional, 1993
(Almost) everything you want
+ Full of detail, but not always easy to find it + great product condition poor customer service
My personal favorite. I have been using both the German and the English version of this boock since 1996, and I just love it. Granted, the world has moved on, and many things about LaTeX have changed and still are, and yet, there is so much information in this book. I only hope the authors soon ...
|
|
|
|
|
|
| |
|
The Universal Turing Machine: A Half-Century Survey
Oxford University Press, USA, 1992
This volume commemorates the work of Alan Turing, who not only introduced the most persuasive and influential concept of a machine model of effective computability but also anticipated in his work contemporary debates about the extent and limitations of mechanistic explanations of nature. Turing's paper "On Computable Numbers, With an Application to the Entscheidungsproblem" appeared in 1937. It ...
|
|
|
|
|
|
| |
|
Alan Turing: The Enigma 19 reviews Andrew Hodges
Walker & Company, 2000
Essential.
+ interesting portrait of a compelling misfit + A scientifically useful biography + Good biography, perhaps too long.
|
|
|
|
|
|
| |
|
Introduction to the Theory of Computation 51 reviews Michael Sipser
Course Technology, 1996
My choice for textbook in my computation theory class
+ Excellent presentation of the material + A very nice book for undergraduates and graduates to understand computation theory. + Don't be afraid of the proofs
|
|
|
|
|
|
| |
|
Information and Randomness: An Algorithmic Perspective (Lecture Notes in Computer Science) 1 review Cristian Calude
Springer, 1994
Classical ideas with modern use.
I stumbled over this (lovely) book a little by accident. As I kept reading, my enthusiasm for the book gradually increased. While the book is addressed perhaps more to students in computation and in CS, it is very attractive also as a text to be used in mainstream mathematics, and in probability ...
|
|
|
|
|
|
| |
|
C Programming Language (2nd Edition) (Prentice Hall Software) 254 reviews Brian W. Kernighan, Dennis M. Ritchie
Prentice Hall PTR, 1988
The Must-have
+ Great Book + The defacto book on C + The Book on C + The definitive C reference bok
|
|
|
|
|
|
| |
|
Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes) 1 review Michael Luby
Princeton University Press, 1996
Definitely worth studying
Walking into a colleague's office and noticing papers scattered all over her desk and shelves, I remarked on the apparent disorganization. She explained that from her standpoint everything was organized and easy to find. Randomness, she said, is observer dependent. This is the theme taken in ...
|
|
|
|
|
|
| |
|
Cryptography: Theory and Practice (Discrete Mathematics and Its Applications) 14 reviews
CRC-Press, 1995
Volume III of the Definitive Work
+ A good reference + Fantastic Book on Cryptography
This book takes a fairly rigorous mathematical approach to cryptography. It is intended for upper level undergraduate and graduate students in mathematics, computer science and engineering. I suspect only the quite mathematically inclined computer science and engineering students will find this ...
|
|
|
|
|
|
| |
|
Complexity Theory Retrospective II
Springer, 1997
Complexity theory has been a flourishing area of research in the last ten years and currently provides one of the most active subjects for future research problems in computer science. This volume provides a survey of the subject in the form of a collection of articles written by experts that to- gether provide a comprehensive guide to research. The editors' aim has been to provide an accessible ...
|
|
|
|
|
|
| |
|
Cryptanalysis 13 reviews Helen F. Gaines
Dover Publications, 1989
Best Book for Manual Ciphers
+ Excellent technical review of classical cryptography + absolutely essential + Best source for pre-computer decryption techniques.
|
|
|
|
|
|
| |
|
The Limits of Mathematics: A course on information theory and the limits of formal reasoning (Springer Series ... 1 review Gregory J. Chaitin
Springer, 1997
A subjective estimation
I wish that I could give this book a higher rating than I have, for the subject matter is one that I find of enormous intrinsic interest. Moreover, Dr. Chaitin is one of the most important contributors to this field of the last 30+ years.
My reasons for being disappointed in this book may well ...
|
|
|
|
|
|
| |
|
Handbook of Applied Cryptography (Discrete Mathematics and Its Applications) 16 reviews
CRC-Press, 1996
Fantastic traditional reference
+ Advanced Crypto for the college mind. + A very detailed book, but not for everyone. + Complete and satisfying + Very depthful yet readable
|
|
|
|
|
|
| |
|
Computability and Complexity Theory (Texts in Computer Science) 5 reviews Steven Homer, Alan L. Selman
Springer, 2001
In fact, it is a great and concise book on the subject
This book is aimed as an introductory text book on computer science theory. The book is suited for both undergraduate and graduate studies. I would have never expected a book of only a few pages to cover computability and complexity theory basics from introductory undergraduate to early graduate ...
|
|
|
|
|
|
| |
|
Foundations of Cryptography: Volume 1, Basic Tools 4 reviews Oded Goldreich
Cambridge University Press, 2001
Superb presentation of the theoretical foundations.
+ A must have for people doing research in theoretical crypto + Fundamental book for anyone working with cryptography
We all know what it means for an algorithm to compute a function, but what does it mean for an encryption scheme to be secure? Traditionally, cryptographic schemes were suggested and attacked based on ad-hoc criterias, for lack of a proper theoretical setting. The last two decades have seen ...
|
|
|
|
|
|
| |
|
RSA Security's Official Guide to Cryptography 5 reviews Steve Burnett, Stephen Paine
McGraw-Hill Osborne Media, 2001
Fast & Fun Crypto
+ A very good combination. + Burnett/Paine hit the "nail on the head" with this book + A great introduction to cryptography
|
|
|
|
|
|
| |
|
The Twofish Encryption Algorithm: A 128-Bit Block Cipher 5 reviews Bruce Schneier, John Kelsey, ...
Wiley, 1999
fascinating to a limited audience
+ A important book to decipher + Official Discription by the people that developed it.
Bruce Schneier is the Yoda of crpytography and information security, if you've heard him there's no need to ask anyone else. This book would probably only appeal to the genuinely avid crypto fan, its Greek to anyone else. It is a thorough exposition of the making of the Twofish cypher, the latest ...
|
|
|
|
|
|
| |
|
Algebraic Aspects of Cryptography (Algorithms and Computation in Mathematics) 2 reviews Neal Koblitz
Springer, 2004
Excellent, but only if you have extensive knowledge of math
+ Excelent
The textbook is intended for students with extensive knowledge of number theory, field theory, and algebraic techniques. It is terse and runs through the material using the definition-lemma-proof-theorem-proof method, with almost no examples. For students without the aforementioned prerequisites, ...
|
|
|
|
|
|