Related-Key Square Attack on AES-192
Zhang Yue-yu
Abstract
Zhang Yue-yu
Abstract
This paper investigates weaknesses in key schedule by exploiting appropriate related-key differences of AES-192.The exact subkey differences in the first 8 round can be confirmed,moreover,a part of secrete key can be deduced by the key bridging technique in Asiacrypt'2010.This paper presents a new method for related-key Square attack on 7-round and 8-round AES-192 with weaknesses in key schedule.This attack on the 8-round AES-192 by the balance of Square attack requires about 244.5 chosen plaintexts,244.5 memory,and 2183.5 8-round AES-192 encryptions.Furthermore,this new attack combined with partial sum technique requires about 244.2 chosen plaintexts,244.2 memory,and 2169.2 8-round AES-192 encryptions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper investigates weaknesses in key schedule by exploiting appropriate related-key differences of AES-192.The exact subkey differences in the first 8 round can be confirmed,moreover,a part of secrete key can be deduced by the key bridging technique in Asiacrypt'2010.This paper presents a new method for related-key Square attack on 7-round and 8-round AES-192 with weaknesses in key schedule.This attack on the 8-round AES-192 by the balance of Square attack requires about 244.5 chosen plaintexts,244.5 memory,and 2183.5 8-round AES-192 encryptions.Furthermore,this new attack combined with partial sum technique requires about 244.2 chosen plaintexts,244.2 memory,and 2169.2 8-round AES-192 encryptions.
Key concepts: Computer science, Key (lock), Computer security, Key schedule, Watermarking attack, Schedule, Cryptanalysis, Cryptography