Revisiting the security proof of QUAD stream cipher: Some corrections and tighter bounds
Document Type
Conference Article
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
In EUROCRYPT 2006, Berbain et al. proposed a provably secure stream cipher named QUAD based on the hardness of solving multivariate quadratic equations. The authors also mentioned that whether the security bound can be made tighter or not is an open problem. Through the last decade, there have been some works on the analysis of QUAD as well as design extensions of QUAD, but to our knowledge no work has addressed the existence of tighter bounds. In this paper, we revisit the proof technique by the authors and correct some bugs in their proof. Further, we derive tighter security bounds using two approaches.
First Page
103
Last Page
116
DOI
10.1007/978-3-319-54705-3_7
Publication Date
1-1-2017
Recommended Citation
Paul, Goutam and Sanyal, Abhiroop, "Revisiting the security proof of QUAD stream cipher: Some corrections and tighter bounds" (2017). Conference Articles. 345.
https://digitalcommons.isical.ac.in/conf-articles/345