LBlock: A Lightweight Block Cipher

Wu, Wenling; Zhang, Lei

doi:10.1007/978-3-642-21554-4_19

Cited by 428 publications

(311 citation statements)

References 37 publications

Supporting

Mentioning

308

Contrasting

Unclassified

Order By: Relevance

“…If real ciphers correspond to these parameters, we specify them. Note that the rotation applied to one of the branches in the round function of LBlock [14] does not change anything. The key-dependent linear FL layers in MISTY1 [15] do not protect from our distinguisher as well and may be included from any side for free.…”

Section: ⊓ ⊔mentioning

confidence: 99%

Algebraic Insights into the Secret Feistel Network

Perrin

Udovenko

2016

Fast Software Encryption

View full text Add to dashboard Cite

Abstract. We introduce the high-degree indicator matrix (HDIM), an object closely related with both the linear approximation table and the algebraic normal form (ANF) of a permutation. We show that the HDIM of a Feistel Network contains very specific patterns depending on the degree of the Feistel functions, the number of rounds and whether the Feistel functions are 1-to-1 or not. We exploit these patterns to distinguish Feistel Networks, even if the Feistel Network is whitened using unknown affine layers. We also present a new type of structural attack exploiting monomials that cannot be present at round − 1 to recover the ANF of the last Feistel function of a -round Feistel Network. Finally, we discuss the relations between our findings, integral attacks, cube attacks, Todo's division property and the congruence modulo 4 of the Linear Approximation Table.

show abstract

Section: ⊓ ⊔mentioning

confidence: 99%

Algebraic Insights into the Secret Feistel Network

Perrin

Udovenko

2016

Fast Software Encryption

View full text Add to dashboard Cite

show abstract

“…LBlock achieves complete diffusion after 8 rounds, as mentioned by the authors of LBlock [61]. So, a single bit leakage after 8 th round may give maximum number of linear relations as compared to inner rounds.…”

Section: Results Of the Preprocessing Phasementioning

confidence: 88%

“…LBlock, LuBan LOCK or Lightweight BLOCK cipher has been proposed by Wu and Zhang in 2011 [61]. The cipher is a good trade off between efficiency and security.…”

Section: Lblock: a Lightweight Block Ciphermentioning

confidence: 99%

See 1 more Smart Citation

On the Security of LBlock against the Cube Attack and Side Channel Cube Attack

Islam

Afzal

Rashdi

2013

Security Engineering and Intelligence Informatics

View full text Add to dashboard Cite

Abstract. In this research, a recently proposed lightweight block cipher LBlock, not tested against the cube attack has been analyzed. 7, 8 and 9 round LBlock have been successfully attacked with complexities of O(2 10.76 ), O(2 11.11 ) and O(2 47.00 ) respectively. For the case of side channel cube attack, full version of LBlock has been attacked using a single bit leakage model with the complexity of O(2 55.00 ) cipher evaluations. For this purpose, a generic practical platform has been developed to test various stream and block ciphers against the latest cube attack.

show abstract

“…Even within the AES family itself the key scheduling of AES-128 is different than AES-192 which is, in turn, different than AES-256, let alone other AES candidates. Furthermore, with the fast spreading deployment of mobile and pervasive devices, there is an increasing effort to design new blockciphers suitable for computationally constrained devices (see, e.g., [19,20,26,37,40,50,53,61,71]) and, in some of them, light key scheduling is a major design goal. For instance, in the Light Encryption Device (LED) blockcipher there is no key scheduling [37].…”

Section: Key Scheduling Effectmentioning

confidence: 99%

Authenticated encryption: how reordering can impact performance

Alomair

2016

Security Comm Networks

View full text Add to dashboard Cite

Abstract. In this work, we look at authenticated encryption schemes from a new perspective. As opposed to focusing solely on the "security" implications of the different methods for constructing authenticated encryption schemes, we investigate the effect of the method used to construct an authenticated encryption scheme on the "performance" of the construction. We show that, as opposed to the current NIST standard, by performing the authentication operation before the encryption operation, the computational efficiency of the construction can be increased, without affecting the security of the overall construction. In fact, we show that the proposed construction is even more secure than standard authentication based on universal hashing in the sense that the hashing key is resilient to key recovery attacks.

show abstract

LBlock: A Lightweight Block Cipher

Cited by 428 publications

References 37 publications

Algebraic Insights into the Secret Feistel Network

Algebraic Insights into the Secret Feistel Network

On the Security of LBlock against the Cube Attack and Side Channel Cube Attack

Authenticated encryption: how reordering can impact performance

Contact Info

Product

Resources

About