PAEQ: Parallelizable Permutation-Based Authenticated Encryption
From MaRDI portal
Publication:3449178
DOI10.1007/978-3-319-13257-0_5zbMath1336.94037OpenAlexW56012719MaRDI QIDQ3449178
Dmitry Khovratovich, Alex Biryukov
Publication date: 3 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/18721
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (7)
Pholkos -- efficient large-state tweakable block ciphers from the AES round function ⋮ QCB is blindly unforgeable ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ A New Structural-Differential Property of 5-Round AES ⋮ A New Mode of Operation for Incremental Authenticated Encryption with Associated Data ⋮ Improved Rebound Attacks on AESQ: Core Permutation of CAESAR Candidate PAEQ ⋮ New Insights on AES-Like SPN Ciphers
This page was built for publication: PAEQ: Parallelizable Permutation-Based Authenticated Encryption