Analysis of xorrotation with application to an HC-128 variant

Authors:
Paul Stankovski;Martin Hell;Thomas Johansson
Affiliations:
Dept. of Electrical and Information Technology, Lund University, Lund, Sweden;Dept. of Electrical and Information Technology, Lund University, Lund, Sweden;Dept. of Electrical and Information Technology, Lund University, Lund, Sweden
Venue:
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Year:
2012

Citing 9
Cited 0

Elements of information theory

Elements of information theory
The Stream Cipher HC-128

New Stream Cipher Designs
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
Rotational cryptanalysis of ARX

FSE'10 Proceedings of the 17th international conference on Fast software encryption
The invertibility of the XOR of rotations of a binary word

International Journal of Computer Mathematics
Some observations on HC-128

Designs, Codes and Cryptography
Solving systems of differential equations of addition

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Improved distinguishers for HC-128

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

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many cryptographic primitives rely on word rotations (R) and xor (X) to provide proper mixing. We give RX-system mixing a very general treatment and deduce some theoretical results on related probability distributions. Pure RX-systems are easy to break, so we show how to apply our theory to a more complex system that uses RX operations in combination with S-boxes. We construct an impractical (keystream complexity 290.9), but new and non-trivial distinguisher for a variant of HC-128 for which modular addition is replaced with xor.