Overview
- One of first books to cover SAT-solvers, and how it can be used in cryptanalysis; plus chapters on finite field linear algebra and the cipher Keeloq
- Excellent guide for advanced-level students, researchers and practitioners entering the algebraic cryptanalysis field
- Bridges the gap between a course in cryptography, and being able to read the cryptanalytic literature, among academics and industry practitioners
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (15 chapters)
-
Front Matter
-
Cryptanalysis
-
Front Matter
-
-
Polynomial Systems and Satisfiability
-
Front Matter
-
-
Back Matter
Keywords
About this book
Algebraic Cryptanalysis bridges the gap between a course in cryptography, and being able to read the cryptanalytic literature. This book is divided into three parts: Part One covers the process of turning a cipher into a system of equations; Part Two covers finite field linear algebra; Part Three covers the solution of Polynomial Systems of Equations, with a survey of the methods used in practice, including SAT-solvers and the methods of Nicolas Courtois.
Topics include:
Analytic Combinatorics, and its application to cryptanalysis
The equicomplexity of linear algebra operations
Graph coloring
Factoring integers via the quadratic sieve, with its applications to the cryptanalysis of RSA
Algebraic Cryptanalysis is designed for advanced-level students in computer science and mathematics as a secondary text or reference book for self-guided study. This book is suitable for researchers in Applied Abstract Algebra or Algebraic Geometry who wish to find more applied topics or practitioners working for security and communications companies.
Reviews
From the reviews:
“Algebraic cryptanalysis is a well-titled book. The theme is the reduction of attacks on ciphers (cryptosystems) to systems of polynomial equations over finite fields and subsequent heuristics for efficiently solving these systems. The book is written from the standpoint of real-world computational algebra, and contains numerous gems concerning details on how various algorithms and the heuristics using them really work. The book has an overall tripartite structure.” (Bruce Litow, ACM Computing Reviews, April, 2010)
“The book contains of 3 parts, each having 5 chapters, and 5 Appendices which describe code-breaking by solving equation systems. The author explains the mathematical background of the breaking method and exemplifies it on various ciphers. … The entire work is well structured having a good mathematical background. … recommended to graduate students who want to do their dissertation in any part of cryptanalysis. It is also useful to researchers in Applied Abstract Algebra, cryptography or any other area of these domains.” (Nicolae Constantinescu, Zentralblatt MATH, Vol. 1183, 2010)
“This book gives an overview of algebraic cryptanalysis. … the book seems to be the only broad treatise on the subject available. … it can show a graduate student where to look further … .” (Safuat Hamdy, Mathematical Reviews, Issue 2012 k)
Authors and Affiliations
Bibliographic Information
Book Title: Algebraic Cryptanalysis
Authors: Gregory V. Bard
DOI: https://doi.org/10.1007/978-0-387-88757-9
Publisher: Springer New York, NY
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag US 2009
Hardcover ISBN: 978-0-387-88756-2Published: 24 August 2009
Softcover ISBN: 978-1-4899-8450-0Published: 06 September 2014
eBook ISBN: 978-0-387-88757-9Published: 14 August 2009
Edition Number: 1
Number of Pages: XXXIII, 356
Topics: Data Structures and Information Theory, Field Theory and Polynomials, Linear and Multilinear Algebras, Matrix Theory, Cryptology, Algebraic Geometry, Systems and Data Security