Related-Key Slide Attacks on Block Ciphers with Secret Components

Published

September 18, 2013

Author(s)

Meltem Sonmez Turan

Abstract

Lightweight cryptography aims to provide sufficient security with low area/power/energy requirements for constrained devices. In this paper, we focus on the lightweight encryption algorithm specified and approved in NRS 009-6-7:2002 by Electricity Suppliers Liaison Committee to be used with tokens in prepayment electricity dispensing systems in South Africa. The algorithm is a 16-round SP network with two 4-to-4 bit S-boxes and a 64-bit permutation. The S-boxes and the permutation are kept secret and provided only to the manufacturers of the system under license conditions. We present related-key slide attacks to recover the secret key and secret components using four scenarios; (i) known S-box and permutation with 2⁴⁸ time complexity using 2¹⁶ + 1 chosen plaintexts; (ii) unknown S-box and known permutation with 2⁵⁵ time complexity using 2^22.71+ 1 chosen plaintexts; (iii) known S-box and unknown permutation with 2⁴⁸ time complexity using 2¹⁶+ 1 chosen plaintexts and 2^12.28 adaptively chosen plaintexts; and finally, (iv) unknown S-box and permutation, with 2⁴⁸ time complexity using 2^22.71 + 1 chosen plaintexts and 2^u31.29u adaptively chosen plaintexts. We also extend these attacks to recover the secret components in a chosen-key setting with practical complexities.

Proceedings Title

Lightweight Cryptography for Security and Privacy (Lecture Notes in Computer Science)

Volume

8162

Conference Dates

May 6-7, 2013

Conference Location

Gebze

Conference Title

Second International Workshop on Lightweight Cryptography for Security and Privacy (LightSec 2013)

Pub Type

Conferences

Download Paper

https://doi.org/10.1007/978-3-642-40392-7_3

Keywords

lightweight block ciphers, related-key slide attacks, secret components

Citation

Sonmez, M. (2013), Related-Key Slide Attacks on Block Ciphers with Secret Components, Lightweight Cryptography for Security and Privacy (Lecture Notes in Computer Science), Gebze, -1, [online], https://doi.org/10.1007/978-3-642-40392-7_3 (Accessed March 15, 2025)