Analysis of Xorrotation With Application to an HC-128 Variant
Author
Editor
- Willy Susilo
- Yi Mu
- Jennifer Seberry
Summary, in English
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 2^{90.9}), but new and non-trivial distinguisher for a variant of HC-128 for which modular addition is replaced with xor.
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 2^{90.9}), but new and non-trivial distinguisher for a variant of HC-128 for which modular addition is replaced with xor.
Department/s
Publishing year
2012
Language
English
Pages
419-425
Publication/Series
LNCS
Volume
7372
Full text
- Available as PDF - 271 kB
- Download statistics
Document type
Conference paper
Publisher
Springer
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Keywords
- RX
- probability distribution
- stream cipher
- HC-128
- cryptanalysis
- distinguisher
Conference name
ACISP 2012
Conference date
2012-07-09
Conference place
Wollongong, Australia
Status
Published
Research group
- Crypto and Security
ISBN/ISSN/Other
- ISBN: 978-3-642-31447-6