2015
DOI: 10.1007/978-3-662-48800-3_17
|View full text |Cite
|
Sign up to set email alerts
|

Midori: A Block Cipher for Low Energy

Abstract: In the past few years, lightweight cryptography has become a popular research discipline with a number of ciphers and hash functions proposed. The designers' focus has been predominantly to minimize the hardware area, while other goals such as low latency have been addressed rather recently only. However, the optimization goal of low energy for block cipher design has not been explicitly addressed so far. At the same time, it is a crucial measure of goodness for an algorithm. Indeed, a cipher optimized with re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
216
0
2

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 294 publications
(218 citation statements)
references
References 33 publications
0
216
0
2
Order By: Relevance
“…Relatedkey cryptanalysis, which was independently introduced by Biham [3] and Knudsen [12], additionally considers the case where the two plaintexts are ciphered † The full specification is presented in [2]. with different keys.…”
Section: Related-key Cryptanalysismentioning
confidence: 99%
See 2 more Smart Citations
“…Relatedkey cryptanalysis, which was independently introduced by Biham [3] and Knudsen [12], additionally considers the case where the two plaintexts are ciphered † The full specification is presented in [2]. with different keys.…”
Section: Related-key Cryptanalysismentioning
confidence: 99%
“…Lightweight block ciphers follow this trend, and aim at providing energy efficient ways to ensure confidentiality for fixed size block messages. In 2015, the authors of [2] consider the challenging task of minimizing the energy cost for a lightweight block cipher. They proposed a lightweight symmetric block cipher scheme called Midori, composed of two versions Midori64 and Midori128, which respectively cipher 64-and 128-bit message blocks.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…As for the attack on 3 rounds, the idea is to work independently on each column of the key, due to the fact that the columns of M 0 depend on different and independent variables. Initially the attacker guesses 1 column (that is 4 nibbles) of the final key, as for examplek [3], and she uses them to partially decrypt c 1 and c 2 , that is she computes 4 nibbles of s 1 := Rk(c 1 ) and of s 2 := Rk(c 2 ). Note that the attacker cannot guess 4 arbitrary nibbles of the final key but an entire column, since she has to compute the Linear Layer M .…”
Section: Firstmentioning
confidence: 99%
“…Starting from [12], in Sect. 3 we investigate the behavior of subspaces in PRINCE. At a high level, we fix a subspace of plaintexts that maintain predictable properties after repeated applications of a key-variant round function.…”
Section: Introductionmentioning
confidence: 99%