Forkcipher: a new primitive for authenticated encryption of very short messages
From MaRDI portal
Publication:2176646
DOI10.1007/978-3-030-34621-8_6zbMATH Open1455.94111OpenAlexW2990961241MaRDI QIDQ2176646FDOQ2176646
Arnab Roy, Reza Reyhanitabar, Antoon Purnal, Damian Vizár, E. A. Andreeva, Virginie Lallemand
Publication date: 5 May 2020
Full work available at URL: https://orbit.dtu.dk/en/publications/1ecb9361-a962-4a45-a410-e76a1c9f6b7a
Cited In (11)
- Authenticated encryption for very short inputs
- Nonce-misuse security of the SAEF authenticated encryption mode
- \textsf{LightMAC}: fork it and make it faster
- On some properties of the curvature and nondegeneracy of Boolean functions
- INT-RUP security of \textsf{SAEB} and \textsf{TinyJAMBU}
- A forkcipher-based pseudo-random number generator
- ZLR: a fast online authenticated encryption scheme achieving full security
- Key guessing strategies for linear key-schedule algorithms in rectangle attacks
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
- OAE-RUP: a strong online AEAD security notion and its application to SAEF
This page was built for publication: Forkcipher: a new primitive for authenticated encryption of very short messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176646)