Atul Luykx
Katholieke Universiteit Leuven
34 Papers
401 Citations
Atul Luykx is an academic researcher from Katholieke Universiteit Leuven. The author has contributed to research in topics: Authenticated encryption & Block cipher. The author has an hindex of 15, co-authored 32 publications. Previous affiliations of Atul Luykx include iMinds & University of California, Davis.
Chat about Author
Papers
How to Securely Release Unverified Plaintext in Authenticated Encryption
Elena Andreeva,Elena Andreeva,Andrey Bogdanov,Atul Luykx,Atul Luykx,Bart Mennink,Bart Mennink,Nicky Mouha,Nicky Mouha,Kan Yasuda +9 more
- 07 Dec 2014
TL;DR: The first formalization of the releasing unverified plaintext (RUP) setting was proposed in this paper, where a plaintext extractor mimicking the decryption oracle is used to fool adversaries without the secret key.
Parallelizable and Authenticated Online Ciphers
Elena Andreeva,Andrey Bogdanov,Atul Luykx,Bart Mennink,Elmar Tischhauser,Kan Yasuda +5 more
- 01 Dec 2013
TL;DR: This work proposes the first parallelizable online cipher, COPE, which performs two calls to the underlying block cipher per plaintext block and is fully parallelizable in both encryption and decryption and extends COPE to create COPA, the first Parallelizable, online authenticated cipher with nonce-misuse resistance.
Beyond 2 c /2 Security in Sponge-Based Authenticated Encryption Modes
Philipp Jovanovic,Atul Luykx,Bart Mennink +2 more
- 07 Dec 2014
TL;DR: The Sponge function is known to achieve 2 c/2 security, where c is the key length as discussed by the authors, and κ is the size of the permutation permutation, and it is known that the Sponge function can achieve the significantly higher bound of min {2 b/2,2 c,2 κ } asymptotically, with b > c.
•Posted Content
Parallelizable and Authenticated Online Ciphers.
TL;DR: COPE as mentioned in this paper is a parallelizable online authenticated cipher with nonce-misuse resistance, which performs two calls to the underlying block cipher per plaintext block and is fully parallelizable in both encryption and decryption.
APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography
Elena Andreeva,Begül Bilgin,Andrey Bogdanov,Atul Luykx,Bart Mennink,Nicky Mouha,Kan Yasuda +6 more
- 03 Mar 2014
TL;DR: This paper proposes APE as the first permutation-based authenticated encryption scheme that is resistant against nonce misuse, and formally proves that APE is secure, based on the security of the underlying permutation.