Pholkos - Efficient Large-State Tweakable Block Ciphers from the AES Round Function

被引:7
|
作者
Bossert, Jannis [1 ]
List, Eik [1 ]
Lucks, Stefan [1 ]
Schmitz, Sebastian [1 ]
机构
[1] Bauhaus Univ Weimar, Weimar, Germany
来源
TOPICS IN CRYPTOLOGY, CT-RSA 2022 | 2022年 / 13161卷
关键词
AES; Tweakable block cipher; Bigger birthday security; CRYPTANALYSIS; BOOMERANG; ATTACKS; ENCRYPTION; ALGORITHMS; SKIPJACK; YOYO; V2;
D O I
10.1007/978-3-030-95312-6_21
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes Pholkos, a family of heavyweight tweakable block ciphers with state and key sizes of >= 256 and tweaks of either 128 or 256 bits. When encrypting large chunks of data under the same key, modes with Pholkos do not require "beyond-birthday security" since it provides "bigger birthday security". This also makes it a good choice for quantum-secure authenticated encryption modes like QCB. Pholkos runs at 1-2 cycles per byte on Intel 6-th generation and more recent, following design principles from Haraka, AESQ, and the TWEAKEY framework. Building on the AES round function not only boosts software performance but also improves security, employing knowledge from two decades of cryptanalysis of the AES.
引用
收藏
页码:511 / 536
页数:26
相关论文
共 13 条
  • [11] Simpira v2: A Family of Efficient Permutations Using the AES Round Function
    Gueron, Shay
    Mouha, Nicky
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2016, PT I, 2016, 10031 : 95 - 125
  • [12] Highly Efficient Implementation of Block Ciphers on Graphic Processing Units for Massively Large Data
    An, SangWoo
    Seo, Seog Chung
    APPLIED SCIENCES-BASEL, 2020, 10 (11):
  • [13] A Collision Attack on a Double-Block-Length Compression Function Instantiated with 8-/9-Round AES-256
    Chien, Jiageng
    Hirose, Shoichi
    Kuwakado, Hidenori
    Miyaji, Atsuko
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (01) : 14 - 21