Algebraic Cryptanalysis - Tapa blanda

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)

This book is one of the first to cover SAT-solvers and how they can be used in cryptanalysis. It includes chapters on finite field linear algebra and the equicomplexity of matrix operations.