New Observations on Piccolo Block Cipher

@inproceedings{Wang2016NewOO,
  title={New Observations on Piccolo Block Cipher},
  author={Yanfeng Wang and Wenling Wu},
  booktitle={CT-RSA},
  year={2016}
}
To reduce the cost in hardware, key schedules of lightweight block ciphers are usually simple and some even are direct linear transformations on master keys. Designers always add some asymmetry round-dependent constants to prevent the well-known slide attack. For linear key schedules, the choice of round constants becomes important but lacks principles. In this paper, we aim at evaluating the robustness of the key schedule algorithm and summarizing some design principles for simple key… 
1 Citations

Weak-Key Distinguishers for AES

TLDR
It is shown that (almost) all the secret-key distinguishers for round-reduced AES currently present in the literature can be set up for a higher number of rounds of AES if the whitening key is a weak-key.

References

SHOWING 1-10 OF 20 REFERENCES

Block Ciphers That Are Easier to Mask: How Far Can We Go?

TLDR
A detailed security analysis of this new cipher taking its design specificities into account is provided, leading us to exploit innovative techniques borrowed from hash function cryptanalysis (that are sometimes of independent interest).

Probabilistic Slide Cryptanalysis and Its Applications to LED-64 and Zorro

TLDR
A new probabilistic technique is presented and shown how to overcome round-dependent constants in a slide attack against a block cipher based on the general Even-Mansour scheme with a single key, which can potentially break more rounds than any previously known cryptanalysis for a specific class of block ciphers.

Advanced Slide Attacks

TLDR
This paper finds very efficient known- and chosen-text attacks on generic Feistel ciphers with a periodic key-schedule with four independent subkeys, and is able to break a DES variant proposed in [2] using just 128 chosen texts and negligible time for the analysis.

New types of cryptanalytic attacks using related keys

  • E. Biham
  • Computer Science, Mathematics
    Journal of Cryptology
  • 2004
TLDR
It is shown that the key-scheduling algorithms of many blockciphers inherit obvious relationships between keys, and use these key relations to attack the blockcips, and that DES is not vulnerable to the related keys attacks.

Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others

TLDR
This paper presents an efficient search tool for finding differential characteristics both in the state and in the key and designs the best related-key and chosen key attacks on AES, byte-Camellia, Khazad, FOX, and Anubis.

Multidimensional meet-in-the-middle attack and its applications to KATAN32/48/64

  • Bo ZhuG. Gong
  • Computer Science, Mathematics
    Cryptography and Communications
  • 2014
TLDR
New attacks on the block cipher family KATAN are proposed by adopting a new framework to analyze symmetric ciphers by guessing intermediate states and dividing algorithms into consecutive sub-ciphers, which can be more time-efficient and memory-efficient than existing attacks.

Security Analysis of the Lightweight Block Ciphers XTEA, LED and Piccolo

TLDR
It is demonstrated that the MITM attack is the most powerful attack in the single-key setting on those ciphers with respect to the number of attacked rounds and the possibility of applying the recent speed-up keysearch based onMITM attack to thoseciphers is considered.

KATAN and KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers

TLDR
A new family of very efficient hardware oriented block ciphers divided into two flavors, which is more compact in hardware, as the key is burnt into the device (and cannot be changed), and achieves encryption speed of 12.5 KBit/sec.

Hash Functions Based on Block Ciphers: A Synthetic Approach

TLDR
64 possible schemes exist, and it is shown that 12 of these are secure; they can be reduced to 2 classes based on linear transformations of variables and a new attack is presented on a scheme suggested by R. Merkle.

The LED Block Cipher

TLDR
This work considers the resistance of ciphers, and LED in particular, to related-key attacks, and is able to derive simple yet interesting AES-like security proofs for LED regarding related- or single- key attacks.