Recently, there has been a new paper accepted to CHES 2016 called "A High Throughput/Gate AES Hardware Architecture by Compressing Encryption and Decryption Datapaths" by R.Ueno et al.
In one line, they proposed a very efficient AES crypto processing technology via Galois filed arithmetic operations. I am no professional in this area, but I was wondering
"Does faster computation of AES allows for faster attacks on AES??"
For example lets assume if differential cryptanalysis was feasible for AES (which is not true). Then since one can compute AES on an input in, say half the time of previous computations, would that lead to an attack that is twice as fast??
I am no expert in this area, so I would like to know out of curiosity whether the paper above has any particular impact on cryptanalysis of AES.