2020
DOI: 10.46586/tosc.v2019.i4.54-80
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Block Ciphers from Tweakable Block Ciphers with Long Tweaks

Abstract: We consider a problem of constructing a secure block cipher from a tweakable block cipher (TBC) with long tweaks. Given a TBC with n-bit blocks and Γn-bit tweaks for Γ ≥ 1, one of the constructions by Minematsu in DCC 2015 shows that a simple iteration of the TBC for 3d rounds yields a block cipher with dn-bit blocks that is secure up to 2dn/2 queries, where d = Γ + 1. In this paper, we show three results.1. Iteration of 3d − 2 rounds is enough for the security up to 2dn/2 queries, i.e., the security remains t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 32 publications
0
1
0
Order By: Relevance
“…Following [Min15], Nakamichi and Iwata [NI19] analysed the TBC-based counterpart of the unbalanced GFS, where a contracting function is used as the round function. They showed the number of rounds to achieve birthday-bound security and BBB security.…”
Section: Introductionmentioning
confidence: 99%
“…Following [Min15], Nakamichi and Iwata [NI19] analysed the TBC-based counterpart of the unbalanced GFS, where a contracting function is used as the round function. They showed the number of rounds to achieve birthday-bound security and BBB security.…”
Section: Introductionmentioning
confidence: 99%