Reference : PAEQ: Parallelizable Permutation-Based Authenticated Encryption
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/18721
PAEQ: Parallelizable Permutation-Based Authenticated Encryption
English
Biryukov, Alex mailto [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) >]
Nov-2014
17th Information Security Conference
Springer International Publishing
Yes
International
978-3-319-13256-3
Information Security, 17th International Conference
12-10-2014
Hong Kong
China
[en] authenticated encryption ; caesar competition ; online
[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.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/18721

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
Paeq-full.pdfExtended versionAuthor postprint615.94 kBView/Open

Additional material(s):

File Commentary Size Access
Open access
paeq-slides.pdfslides617.99 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.