A theoretical analysis of the structure of HC-128

Authors:
Goutam Paul;Subhamoy Maitra;Shashwat Raizada
Affiliations:
Department of Computer Science and Engineering, Jadavpur University, Kolkata, India;Applied Statistics Unit, Indian Statistical Institute, Kolkata, India;Applied Statistics Unit, Indian Statistical Institute, Kolkata, India
Venue:
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Year:
2011

Citing 8
Cited 2

Large components of bipartite random mappings

Proceedings of the ninth international conference on on Random structures and algorithms
Analysis Methods for (Alleged) RCA

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Combinatorics, Probability and Computing
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence

Combinatorics, Probability and Computing
New State Recovery Attack on RC4

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
The Key and IV Setup of the Stream Ciphers HC-256 and HC-128

NSWCTC '09 Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02
Some observations on HC-128

Designs, Codes and Cryptography
Differential fault analysis of HC-128

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa

Impact of extending side channel attack on cipher variants: a case study with the HC series of stream ciphers

SPACE'12 Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography Engineering
Optimized GPU implementation and performance analysis of HC series of stream ciphers

ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

HC-128 is an eSTREAM finalist and no practical attack on this cipher is known. We show that the knowledge of any one of the two internal state arrays of HC-128 along with the knowledge of 2048 keystream words is sufficient to construct the other state array completely in 242 time complexity. Though our analysis does not lead to any attack on HC-128, it reveals a structural insight into the cipher. In the process, we theoretically establish certain combinatorial properties of HC-128 keystream generation algorithm. Our work may be considered as the first step towards a possible state recovery of HC-128. We also suggest a modification to HC-128 that takes care of the recently known cryptanalytic results with little reduction in speed.