Paper published in a book (Scientific congresses, symposiums and conference proceedings)
PAEQ: Parallelizable Permutation-Based Authenticated Encryption
Biryukov, Alex; Khovratovich, Dmitry
2014In 17th Information Security Conference
Peer reviewed
 

Files


Full Text
Paeq-full.pdf
Author postprint (630.72 kB)
Extended version
Download
Annexes
paeq-slides.pdf
(632.82 kB)
slides
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
authenticated encryption; caesar competition; online
Abstract :
[en] We propose a new authenticated encryption scheme PAEQ, which employs a fixed public permutation. In contrast to the recent sponge-based proposals, our scheme is fully parallelizable. It also allows flexible key and nonce length, and is one of the few which achieves 128-bit security for both confidentiality and data authenticity with the same key length. The permutation within PAEQ is a new design called AESQ, which is based on AES and is 512 bits wide. In contrast to similar constructions used in the SHA-3 competition, our permutation fully benefits from the newest Intel AES instructions and runs at 2.5 cycles per byte if used as the counter-mode PRF.
Disciplines :
Computer science
Author, co-author :
Biryukov, Alex ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Khovratovich, Dmitry ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Language :
English
Title :
PAEQ: Parallelizable Permutation-Based Authenticated Encryption
Publication date :
November 2014
Event name :
Information Security, 17th International Conference
Event place :
Hong Kong, China
Event date :
12-10-2014
Audience :
International
Main work title :
17th Information Security Conference
Publisher :
Springer International Publishing
ISBN/EAN :
978-3-319-13256-3
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 10 November 2014

Statistics


Number of views
211 (4 by Unilu)
Number of downloads
385 (3 by Unilu)

Bibliography


Similar publications



Contact ORBilu