No abstract

No abstract

No abstract

We analyze an algebraic representation of as an embedding in due to Murphy and Robshaw. We present two systems of equations and concerning encryption and key generation processes. After some simple but rather cumbersome substitutions, we should obtain two new systems and has 16 very dense equations of degree up to 255 in each of its 16 variables. With a single pair with a cleartext and its encryption, its roots give all possible keys that should encrypt to may be defined using 11 or more pairs and has 16 times as many equations in 176 variables. and most of is invariant for all key choices.

It has been suggested that the algebraic structure of AES (and other similar block ciphers) could lead to a weakness exploitable in new attacks. In this paper, we use the algebraic structure of AES-like ciphers to construct a novel cipher embedding where the ciphers may lose their non-linearity. We show some examples and we discuss the limitations of our approach.