Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The first step In Algebraic-attack is expressing the cipher operations as a system of equations. Is there an automated tool to do this?

share|improve this question
Part of the "art" of algebraic attacks is finding the appropriate field to embed the operations into. I would suspect if an automated tool were to be implemented (none to my knowledge), it wouldn't be very useful at finding "nice" representations. For example with AES, some operations are cleanly representable in GF(2) while others in GF(2^8). You can embed everything into GF(2^8) (e.g, big encryption scheme BES) but the representation gets messy. – PulpSpy Jul 14 '11 at 15:07
up vote 5 down vote accepted

Theoretically, the equations could be derived from the representation of the cipher in a hardware description language like VHDL or Verilog; you implement the cipher as if you want to make a FPGA/ASIC which runs it, but you stop at the symbolic representation of the logic gates (the "netlist"). However, I am not aware of any existing conversion tool which will transform a netlist into a sequence of equations in the right format for whatever equation solver you want to use for performing the attack.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.