@inproceedings{6e942a6d68724dbbb0b4fdcf0a91c13e,
title = "Gradient Cryptanalysis of Block Cipher CHAM 64/128",
abstract = "We1 provide the results of cryptanalysis of the lightweight block cipher CHAM 64/128 carried out by means of a so-called gradient statistical attack. The experiments show that after 23 rounds the secret key can be determined with probability 0.01 under the length of the input sample 231 bytes and complexity 237 round function evaluations. Theoretical extrapolation of the suggested attack shows that the key can be completely determined with probability 0.01 after 57 rounds. The recommended number of rounds for CHAM 64/128 is 80. According to the cipher designers, the most successful attack has been a related-key boomerang attack which is effective on 56 rounds.",
keywords = "block ciphers, cryptanalysis, Lightweight ciphers, statistical attack",
author = "Boris Ryabko and Alexander Soskov and Andrey Fionov",
year = "2019",
month = oct,
doi = "10.1109/REDUNDANCY48165.2019.9003315",
language = "English",
series = "2019 16th International Symposium {"}Problems of Redundancy in Information and Control Systems{"}, REDUNDANCY 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "211--215",
booktitle = "2019 16th International Symposium {"}Problems of Redundancy in Information and Control Systems{"}, REDUNDANCY 2019",
address = "United States",
note = "16th International Symposium {"}Problems of Redundancy in Information and Control Systems{"}, REDUNDANCY 2019 ; Conference date: 21-10-2019 Through 25-10-2019",
}