Rating:
(3 reviews)
Author: Daniel J. Bernstein Johannes Buchmann Erik Dahmen
ISBN : 3540887016
New from $69.00
Format: PDF, EPUB
Download electronic versions of selected books Free Post-Quantum Cryptography [Hardcover] from mediafire, rapishare, and mirror link
Quantum computers will break today's most popular public-key cryptographic systems, including RSA, DSA, and ECDSA. This book introduces the reader to the next generation of cryptographic algorithms, the systems that resist quantum-computer attacks: in particular, post-quantum public-key encryption systems and post-quantum public-key signature systems.
Leading experts have joined forces for the first time to explain the state of the art in quantum computing, hash-based cryptography, code-based cryptography, lattice-based cryptography, and multivariate cryptography. Mathematical foundations and implementation issues are included.
This book is an essential resource for students and researchers who want to contribute to the field of post-quantum cryptography.
Books with free ebook downloads available Free Post-Quantum Cryptography
- Hardcover: 245 pages
- Publisher: Springer; 2009 edition (November 19, 2008)
- Language: English
- ISBN-10: 3540887016
- ISBN-13: 978-3540887010
- Product Dimensions: 0.6 x 9.1 x 6.1 inches
- Shipping Weight: 1.2 pounds (View shipping rates and policies)
Free Post-Quantum Cryptography
When you look at some of the most expensive books on Amazon, they are usually proceedings of conferences on very narrow topics that contain state of the art information on that niche. Often they are also published by Springer!
This little gem is somewhat of an exception. It is NOT a conference piece, but does use individual, expert authors to write each article, and each article DOES have numerous pages of supporting research papers, albeit mostly from the late 1990s and early 2000's.
Since "quantum computing" (QC) (a theoretical field, since quantum computers probably won't be actually built for at least 10 years or more) is applied to the hardness of encryption schemes in this book, you've got to add another 15 to 20 years to actually "assume" that QC can break a block cipher or hash table that's presently (relatively) intractable to classical computing. This is because cryptanalysts can't "prove" a negative-- that this or that system can or can't be broken by QC-- except by watching the research results of penetration trial, error and research.
I mean, practically, DES, and even relatively high rounds of AES, have already been broken with classical computing! This has taken over 30 years in the case of DES, and speculation in this volume is that QC will greatly speed up this process. That's the bottom line: this is an outstanding book of speculation-- looking at where QC is and isn't effective via theoretical QC algorithms alone (given no quantum machines to try them on yet). Most of this speculation will be irrelevant when and if real superpositioning machines are built. The interesting thing about cryptography is that the non deterministic probability cloud results of QC become deterministic-- because we either break the cipher or don't!
-
Download Link 2