This review paper discusses attacks on the advanced encryption standard algorithm called Rijndael. Earlier, the best attack on Rijndael compromised up to six rounds of the algorithm. The original attacks require nearly the entire Rijndael codebook, which is impractical even for an adversary with high computing power. The complexity of the original attack was 272. This article attempts to reduce the complexity of the attack to 244. A partial sum method can be utilized to do reduce the complexity. This paper also discusses how to break consecutive rounds of security. We can utilize similar partial sum methods to the one used in reducing the complexity of the original attack, to break these consecutive rounds of security. The attacks are a variation of the original square attack used on the six-round ciphers.Cite the ArticleSukhjeet Singh, Sandeep Kaur. A Review and Analysis of Improved Cryptography Algorithm. Research & Reviews: A Journal of Embedded System & Applications. 2016; 4(1): 13–16p.
