Overview
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.
Full Product Details
Author: Gregory Bard
Publisher: Springer-Verlag New York Inc.
Imprint: Springer-Verlag New York Inc.
Edition: 2009 ed.
Dimensions:
Width: 15.50cm
, Height: 2.20cm
, Length: 23.50cm
Weight: 1.600kg
ISBN: 9780387887562
ISBN 10: 0387887563
Pages: 356
Publication Date: 24 August 2009
Audience:
College/higher education
,
Postgraduate, Research & Scholarly
Format: Hardback
Publisher's Status: Active
Availability: Out of print, replaced by POD
We will order this item for you from a manufatured on demand supplier.
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)
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)
