In this master thesis we present new representations of the AES key schedules, with some implications to the security of AES-based schemes. In particular, we show that the AES-128 key schedule can be split into four independent parallel computations operating on 32 bits, up to linear transformation. Surprisingly, this property has not been described in the literature after more than 20 years of analysis of AES. As a consequence, iterating an odd number of key-schedule rounds results in a function with short cycles. This explains an observation of Khairallah on mixFeed, a second-round candidate in the NIST lightweight competition. Our analysis actually shows that his forgery attack on mixFeed succeeds with probability 0.44, completely breaking the scheme. The same observation also leads to a novel attack on ALE, another AES-based AEAD scheme.