RSS Feeds

Earth Science

Space Science

Life Science

Fields of Scientific Study

Nanotechnology

Cancer

Definitions of The Fields of Scientific Study

Post-Quantum Cryptography | Hardcover

by Daniel J. Bernstein (Editor), Johannes Buchmann (Editor), Erik Dahmen (Editor)

List Price:

$89.95

Available:

Usually ships in 24 hours

Binding:

Hardcover

Publisher:

Springer

Edition:

1st Edition

Page Count:

245 Pages

Publication Date:

November 17, 2008

Sales Rank:

1,404,874st

EDITORIAL REVIEWS

Product Description
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.

SIMILAR PRODUCTS

	The Princeton Companion to Mathematics by Timothy Gowers (Editor), June Barrow-Green (Editor), Imre Leader (Editor) This is a one-of-a-kind reference for anyone with a serious interest in mathematics. Edited by Timothy Gowers, a recipient of the Fields Medal, it presents nearly two hundred entries, written especially for this book by some of the world's leading mathematicians, that introduce basic mathematical tools and vocabulary; trace the development of modern mathematics; explain essential terms and concepts; examine core ideas in major areas of mathematics; describe the achievements of scores of...
	An Introduction to Mathematical Cryptography (Undergraduate Texts in Mathematics) by Jeffrey Hoffstein (Author), Jill Pipher (Author), J.H. Silverman (Author) This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing the mathematical tools needed for the construction and security analysis of diverse cryptosystems. Only basic linear algebra is required of the reader; techniques from algebra, number theory, and probability are introduced and developed as required. The book covers a variety of topics...
	Computational Complexity: A Modern Approach by Sanjeev Arora (Author), Boaz Barak (Author) This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.
	Elliptic Curves: Number Theory and Cryptography, Second Edition (Discrete Mathematics and Its Applications) by Lawrence C. Washington (Author) Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. With additional exercises, this edition offers more comprehensive coverage of the fundamental theory, techniques, and applications of elliptic curves. New to the Second Edition Chapters on isogenies and hyperelliptic curves A discussion of alternative coordinate...
	Handbook of Elliptic and Hyperelliptic Curve Cryptography (Discrete Mathematics and Its Applications) by Henri Cohen (Editor), Gerhard Frey (Editor), Roberto Avanzi (Editor), Christophe Doche (Editor), Tanja Lange (Editor), Kim Nguyen (Editor), Frederik Vercauteren (Editor) The discrete logarithm problem based on elliptic and hyperelliptic curves has gained a lot of popularity as a cryptographic primitive. The main reason is that no subexponential algorithm for computing discrete logarithms on small genus curves is currently available, except in very special cases. Therefore curve-based cryptosystems require much smaller key sizes than RSA to attain the same security level. This makes them particularly attractive for implementations on memory-restricted devices...