Sammanfattning
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.
| Originalspråk | engelska |
|---|---|
| Titel på värdpublikation | LNCS |
| Redaktörer | Willy Susilo, Yi Mu, Jennifer Seberry |
| Förlag | Springer |
| Sidor | 419-425 |
| Volym | 7372 |
| ISBN (tryckt) | 978-3-642-31447-6 |
| Status | Published - 2012 |
| Evenemang | ACISP 2012 - Wollongong, Australien Varaktighet: 2012 juli 9 → … |
Publikationsserier
| Namn | |
|---|---|
| Volym | 7372 |
Konferens
| Konferens | ACISP 2012 |
|---|---|
| Land/Territorium | Australien |
| Ort | Wollongong |
| Period | 2012/07/09 → … |
Ämnesklassifikation (UKÄ)
- Elektroteknik och elektronik