Permutation-Based Deterministic Authenticated Encryption with Minimum Memory Size

被引:0
|
作者
Hiraga, Yukihito [1 ]
Naito, Yusuke [2 ]
Sasaki, Yu [3 ]
Sugawara, Takeshi [1 ]
机构
[1] Univ Electrocommun, Tokyo, Japan
[2] Mitsubishi Electr Corp, Yokohama, Kanagawa, Japan
[3] NTT Social Informat Labs, Tokyo, Japan
来源
关键词
Deterministic Authenticated Encryption; Permutation; Low Memory; Mode; SIV; Security Proof; Hardware; PHOTON256; LIGHTWEIGHT; SECURITY;
D O I
10.1007/978-3-031-49187-0_18
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Deterministic authenticated encryption (DAE) provides data integrity and authenticity with certain robustness. Previous DAE schemes for low memory are based on block ciphers (BCs) or tweakable block ciphers (TBCs), which can be implemented with 3s bits of memory for s-bit security. On the other hand, schemes based on cryptographic permutations have attracted many researchers and standardization bodies. However, existing permutation-based DAEs require at least 4s bits, or even 5s bits of memory. In this paper, PALM, a new permutationbased DAE mode that can be implemented only with 3s bits of memory is proposed, implying that permutation-based DAEs achieve a competitive memory size with BC- and TBC-based DAEs. Our hardware implementation of PALM, instantiated with PHOTON256 for 128-bit security, achieves 3,585 GE, comparable with the state-of-the-art TBC-based DAE. Finally, optimality of 3s bits of memory of PALM is shown.
引用
收藏
页码:351 / 371
页数:21
相关论文
共 50 条
  • [31] A Reconfigurable Permutation Based Address Encryption Architecture for Memory Security
    Mei, Yuchen
    Du, Li
    He, Xuewen
    Du, Yuan
    Chen, Xiaoliang
    Wang, Zhongfeng
    2020 IEEE 33RD INTERNATIONAL SYSTEM-ON-CHIP CONFERENCE (SOCC), 2020, : 7 - 12
  • [32] The query complexity of a permutation-based variant of Mastermind
    Afshani, Peyman
    Agrawal, Manindra
    Doerr, Benjamin
    Doerr, Carola
    Larsen, Kasper Green
    Mehlhorn, Kurt
    DISCRETE APPLIED MATHEMATICS, 2019, 260 : 28 - 50
  • [33] Farasha: A Provable Permutation-Based Parallelizable PRF
    Aaraj, Najwa
    Bellini, Emanuele
    Jejurikar, Ravindra
    Manzano, Marc
    Rohit, Raghvendra
    Salazar, Eugenio
    SELECTED AREAS IN CRYPTOGRAPHY, SAC 2022, 2024, 13742 : 437 - 458
  • [34] A permutation-based estimator for monotone index models
    Bhattacharya, Debopam
    ECONOMETRIC THEORY, 2008, 24 (03) : 795 - 807
  • [35] Parallelizable Authenticated Encryption with Small State Size
    Inoue, Akiko
    Minematsu, Kazuhiko
    SELECTED AREAS IN CRYPTOGRAPHY - SAC 2019, 2020, 11959 : 618 - 644
  • [36] Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom Permutation
    Choi, Wonseok
    Lee, Byeonghak
    Lee, Jooyoung
    Lee, Yeongmin
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2021, PT III, 2021, 13092 : 407 - 434
  • [37] Permutation-Based Hashing Beyond the Birthday Bound
    Lefevre, Charlotte
    Mennink, Bart
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2024, 2024 (01) : 71 - 113
  • [38] Employing GPU architectures for permutation-based indexing
    Krulis, Martin
    Osipyan, Hasmik
    Marchand-Maillet, Stephane
    MULTIMEDIA TOOLS AND APPLICATIONS, 2017, 76 (09) : 11859 - 11887
  • [39] A Permutation-Based Kernel Conditional Independence Test
    Doran, Gary
    Muandet, Krikamol
    Zhang, Kun
    Scholkoepf, Bernhard
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2014, : 132 - 141
  • [40] Runtime Analysis for Permutation-based Evolutionary Algorithms
    Benjamin Doerr
    Yassine Ghannane
    Marouane Ibn Brahim
    Algorithmica, 2024, 86 : 90 - 129