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

I'm reading through Chow et al.'s paper and Link et al.'s paper.

There's a part I don't understand about Delinearization.

They convert some steps of AES/DES into a Matrix, then divide the matrix in 8x4 matrices and use look up tables to do the multiplications. But for the XOR they also use look up tables.

What is the use in that? It's pretty easy to see, even through a look up table, that we're doing simple XORs here.

PS: What I'm talking about can be seen here at page 30:

share|improve this question

Your Answer


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

Browse other questions tagged or ask your own question.