Improved Differential-Linear Cryptanalysis of Reduced Rounds of ChaCha Permutation

ChaCha is a stream cipher that has been adopted in TLS1.3 and is widely used around the world. Therefore, any vulnerability in ChaCha has a significant global impact, making the security analysis of its permutation a critical issue. Currently, no analysis has successfully extended beyond 8 rounds of ChaCha, and reducing the computational complexity for fewer rounds remains a challenge for future research. The primary methods of analyzing ChaCha include differential analysis, which examines the relationship between input and output differences; linear analysis, based on linear approximations; and Differential-Linear analysis, a combination of both approaches. The computational complexity of Differential-Linear analysis depends heavily on the linear bias. Therefore, we focus on increasing the linear bias and aim to reduce the computational complexity by deriving a linear approximation with a larger bias. To achieve this, we first reduce the number of linear rounds to 3 or 3.5 in order to increase the bias. Then, we derive the linear approximation between 4 or 4.25 and 7 rounds of ChaCha and identify the corresponding input and output differences. Next, to further increase the number of analysis rounds, we extend the linear approximation derived from 7-round ChaCha analysis. We analyze the 7.25-round ChaCha Permutation with computational complexity of 2182.57 and 2104.20. In addition we perform Differential-Linear analysis for 7.5-round ChaCha with computational complexity of 2222.54 and 2132.18. Although our analysis is a distinguisher, it can be extended to a key recovery attacks or differential analysis by considering final adition, which would have a significant on the overall security analysis of ChaCha.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Published
2025-03-23
DOI
https://doi.org/10.1587/transfun.2024dmp0008
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved Differential-Linear Cryptanalysis of Reduced Rounds of ChaCha Permutation

Atsuko Miyaji, Y. Okada, Ryo Watanabe, Nasratullah Ghafoori
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Coding theory and cryptography
article

Improved Differential-Linear Cryptanalysis of Reduced Rounds of ChaCha Permutation

Atsuko Miyaji, Y. Okada, Ryo Watanabe, Nasratullah Ghafoori
article en

Abstract

ChaCha is a stream cipher that has been adopted in TLS1.3 and is widely used around the world. Therefore, any vulnerability in ChaCha has a significant global impact, making the security analysis of its permutation a critical issue. Currently, no analysis has successfully extended beyond 8 rounds of ChaCha, and reducing the computational complexity for fewer rounds remains a challenge for future research. The primary methods of analyzing ChaCha include differential analysis, which examines the relationship between input and output differences; linear analysis, based on linear approximations; and Differential-Linear analysis, a combination of both approaches. The computational complexity of Differential-Linear analysis depends heavily on the linear bias. Therefore, we focus on increasing the linear bias and aim to reduce the computational complexity by deriving a linear approximation with a larger bias. To achieve this, we first reduce the number of linear rounds to 3 or 3.5 in order to increase the bias. Then, we derive the linear approximation between 4 or 4.25 and 7 rounds of ChaCha and identify the corresponding input and output differences. Next, to further increase the number of analysis rounds, we extend the linear approximation derived from 7-round ChaCha analysis. We analyze the 7.25-round ChaCha Permutation with computational complexity of 2182.57 and 2104.20. In addition we perform Differential-Linear analysis for 7.5-round ChaCha with computational complexity of 2222.54 and 2132.18. Although our analysis is a distinguisher, it can be extended to a key recovery attacks or differential analysis by considering final adition, which would have a significant on the overall security analysis of ChaCha.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesVol. E108.A(9)
Panasonic (Japan) (JP), The University of Osaka (JP)
Secom Science and Technology Foundation, Japan Society for the Promotion of Science
Openalex Percentile: Top 98%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.