General classification of the authenticated encryption schemes for the CAESAR competition
| Autor: | Farzaneh Abed, Christian Forler, Stefan Lucks |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Authenticated encryption
General Computer Science business.industry Computer science 020206 networking & telecommunications Cryptography 02 engineering and technology Computer security computer.software_genre Theoretical Computer Science Symmetric-key algorithm Robustness (computer science) 0202 electrical engineering electronic engineering information engineering NIST 020201 artificial intelligence & image processing business computer |
| Zdroj: | Computer Science Review. 22:13-26 |
| ISSN: | 1574-0137 |
| DOI: | 10.1016/j.cosrev.2016.07.002 |
| Popis: | An authenticated encryption scheme is a scheme which provides privacy and integrity by using a secret key. In 2013, CAESAR (the “Competition for Authenticated Encryption: Security, Applicability, and Robustness”) was co-founded by NIST and Dan Bernstein with the aim of finding authenticated encryption schemes that offer advantages over AES-GCM and are suitable for widespread adoption. The first round started with 57 candidates in March 2014; and nine of these first-round candidates were broken and withdrawn from the competition. The remaining 48 candidates went through an intense process of review, analysis and comparison. While the cryptographic community benefits greatly from the manifold different submission designs, their sheer number implies a challenging amount of study. This paper provides an easy-to-grasp overview over functional aspects, security parameters, and robustness offerings by the CAESAR candidates, clustered by their underlying designs (block-cipher-, stream-cipher-, permutation-/sponge-, compression-function-based, dedicated). After intensive review and analysis of all 48 candidates by the community, the CAESAR committee selected only 30 candidates for the second round. The announcement for the third round candidates was made on 15th August 2016 and 15 candidates were chosen for the third round. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect