In this paper, we study how exploiting multiple differential characteristics with a common initial difference and different output differences improves the complexity of differential cryptanalysis attack. We call such an approach Multiple Differential Cryptanalysis. We describe such an attack rigorously by studying the probability distribution of multiple differential characteristics and giving an attack algorithm based on LLR statistic. We also present a statistical analysis on the attack complexity based on LLR probabilistic technique. Our analysis shows that the data complexity of the proposed attack decreases as the number of characteristics increases. We do an experiment with the described method to show its improvements through cryptanalyzing a reduced round PRESENT block cipher with 5 rounds.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Saeed SADEGHIAN, Babak SADEGHIYAN, "A Study of Multiple Characteristics Differential Cryptanalysis" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 10, pp. 2053-2058, October 2011, doi: 10.1587/transfun.E94.A.2053.
Abstract: In this paper, we study how exploiting multiple differential characteristics with a common initial difference and different output differences improves the complexity of differential cryptanalysis attack. We call such an approach Multiple Differential Cryptanalysis. We describe such an attack rigorously by studying the probability distribution of multiple differential characteristics and giving an attack algorithm based on LLR statistic. We also present a statistical analysis on the attack complexity based on LLR probabilistic technique. Our analysis shows that the data complexity of the proposed attack decreases as the number of characteristics increases. We do an experiment with the described method to show its improvements through cryptanalyzing a reduced round PRESENT block cipher with 5 rounds.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.2053/_p
Copy
@ARTICLE{e94-a_10_2053,
author={Saeed SADEGHIAN, Babak SADEGHIYAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Study of Multiple Characteristics Differential Cryptanalysis},
year={2011},
volume={E94-A},
number={10},
pages={2053-2058},
abstract={In this paper, we study how exploiting multiple differential characteristics with a common initial difference and different output differences improves the complexity of differential cryptanalysis attack. We call such an approach Multiple Differential Cryptanalysis. We describe such an attack rigorously by studying the probability distribution of multiple differential characteristics and giving an attack algorithm based on LLR statistic. We also present a statistical analysis on the attack complexity based on LLR probabilistic technique. Our analysis shows that the data complexity of the proposed attack decreases as the number of characteristics increases. We do an experiment with the described method to show its improvements through cryptanalyzing a reduced round PRESENT block cipher with 5 rounds.},
keywords={},
doi={10.1587/transfun.E94.A.2053},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - A Study of Multiple Characteristics Differential Cryptanalysis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2053
EP - 2058
AU - Saeed SADEGHIAN
AU - Babak SADEGHIYAN
PY - 2011
DO - 10.1587/transfun.E94.A.2053
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2011
AB - In this paper, we study how exploiting multiple differential characteristics with a common initial difference and different output differences improves the complexity of differential cryptanalysis attack. We call such an approach Multiple Differential Cryptanalysis. We describe such an attack rigorously by studying the probability distribution of multiple differential characteristics and giving an attack algorithm based on LLR statistic. We also present a statistical analysis on the attack complexity based on LLR probabilistic technique. Our analysis shows that the data complexity of the proposed attack decreases as the number of characteristics increases. We do an experiment with the described method to show its improvements through cryptanalyzing a reduced round PRESENT block cipher with 5 rounds.
ER -