The Fixed-Point Attack

  • Gregory V. Bard


Here the author will explain the attack that was the opening of his dissertation. The goal is first, to rewrite the cipher as a function g executed on the output of a function f which is iterated 8 times on the plaintext. Next, we will strip away g, and try to find fixed points of the 8th iterate of f. Some of these are fixed points of f. Using fixed points of f, we can recover the secret key by solving a polynomial system of equations. As you can see, the attack is rather indirect.


Success Probability Constraint Satisfaction Problem Polynomial System Analytic Combinatorics Matching Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.Department of MathematicsFordham UniversityBronxUSA

Personalised recommendations