$\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms

Suzaki, T.; Minematsu, Kazuhiko; Morioka, Sumio; Kobayashi, Eita

doi:10.1007/978-3-642-35999-6_22

Cited by 240 publications

(157 citation statements)

References 32 publications

Supporting

Mentioning

157

Contrasting

Order By: Relevance

“…In the area of symmetric-key encryption some of the more prominent block ciphers that were proposed are: Present [7], Piccolo [18], Klein [10], Twine [20], Katan and Ktantan [8], LED [11], HIGHT [12] and CLEFIA [19].…”

Section: Introductionmentioning

confidence: 99%

Differential Analysis of Block Ciphers SIMON and SPECK

Biryukov

Roy

Velichkov

2015

Lecture Notes in Computer Science

112

View full text Add to dashboard Cite

Abstract. In this paper we continue the previous line of research on the analysis of the differential properties of the lightweight block ciphers Simon and Speck. We apply a recently proposed technique for automatic search for differential trails in ARX ciphers and improve the trails in Simon32 and Simon48 previously reported as best. We further extend the search technique for the case of differentials and improve the best previously reported differentials on Simon32, Simon48 and Simon64 by exploiting more effectively the strong differential effect of the cipher. We also present improved trails and differentials on Speck32, Speck48 and Speck64. Using these new results we improve the currently best known attacks on several versions of Simon and Speck. A second major contribution of the paper is a graph based algorithm (linear time) for the computation of the exact differential probability of the main building block of Simon: an AND operation preceded by two bitwise shift operations. This gives us a better insight into the differential property of the Simon round function and differential effect in the cipher. Our algorithm is general and works for any rotation constants. The presented techniques are generic and are therefore applicable to a broader class of ARX designs.

show abstract

Section: Introductionmentioning

confidence: 99%

Differential Analysis of Block Ciphers SIMON and SPECK

Biryukov

Roy

Velichkov

2015

Lecture Notes in Computer Science

112

View full text Add to dashboard Cite

show abstract

“…For example, since the seminal work of Nyberg on this topic [5], the inverse function in the finite field of size 2 is often used (see the Advanced Encryption Standard [1], TWINE [6]...).…”

Section: Introductionmentioning

confidence: 99%

Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1

Biryukov

Perrin

Udovenko

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The Russian Federation's standardization agency has recently published a hash function called Streebog and a 128-bit block cipher called Kuznyechik. Both of these algorithms use the same 8-bit S-Box but its design rationale was never made public. In this paper, we reverse-engineer this S-Box and reveal its hidden structure. It is based on a sort of 2-round Feistel Network where exclusive-or is replaced by a finite field multiplication. This structure is hidden by two different linear layers applied before and after. In total, five different 4-bit S-Boxes, a multiplexer, two 8-bit linear permutations and two finite field multiplications in a field of size 2 4 are needed to compute the S-Box. The knowledge of this decomposition allows a much more efficient hardware implementation by dividing the area and the delay by 2.5 and 8 respectively. However, the small 4-bit S-Boxes do not have very good cryptographic properties. In fact, one of them has a probability 1 differential. We then generalize the method we used to partially recover the linear layers used to whiten the core of this S-Box and illustrate it with a generic decomposition attack against 4-round Feistel Networks whitened with unknown linear layers. Our attack exploits a particular pattern arising in the Linear Approximations Table of such functions.

show abstract

“…To show the strength of our tool, we apply it to TWINE-80 [20] and mount a MITM attack based on the found results. The number of rounds we can reach is 14 rounds, while the designers confirmed that the subkeys for the first 3 rounds contain all 80 master key bits.…”

Section: Application To Twine-80mentioning

confidence: 99%

“…TWINE-80 iterates 36 rounds to encrypt 64-bit block message with 80-bit master key. We refer to [20] for more details about this cipher.…”

Section: Appendixmentioning

confidence: 99%

See 1 more Smart Citation

On the Key Schedule of Lightweight Block Ciphers

Huang

Vaudenay

Lai

2014

Progress in Cryptology -- INDOCRYPT 2014

View full text Add to dashboard Cite

Abstract. Key schedules in lightweight block ciphers are often highly simplified, which causes weakness that can be exploited in many attacks. Today it remains an open problem on how to use limited operations to guarantee enough diffusion of key bits in lightweight key schedules. Also, there are few tools special for detecting weakness in the key schedule. In 2013 Huang et al. pointed out that insufficient actual key information (AKI) in computation chains is responsible for many attacks especially the meet-in-the-middle (MITM) attacks. Motivated by this fact, in this paper we develop an efficient (with polynomial time complexity) and effective tool to search the computation chains which involve insufficient AKI for iterated key schedules of lightweight ciphers. The effectiveness of this tool is shown by an application on TWINE-80. Then, we formulate the cause of key bits leakage phenomenon, where the knowledge of subkey bits is leaked or overlapped by other subkey bits in the same computation chain. Based on the interaction of diffusion performed by the key schedule and by the round function, a necessary condition is thus given on how to avoid key bits leakage. Therefore, our work sheds light on the design of lightweight key schedules by guiding how to quickly rule out unreasonable key schedules and maximize the security under limited diffusion.

show abstract

$\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms

Cited by 240 publications

References 32 publications

Differential Analysis of Block Ciphers SIMON and SPECK

Differential Analysis of Block Ciphers SIMON and SPECK

Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1

On the Key Schedule of Lightweight Block Ciphers

Contact Info

Product

Resources

About