On the optimality of non-linear computations for symmetric key primitives
From MaRDI portal
Publication:1755961
DOI10.1515/JMC-2017-0011zbMath1420.94028OpenAlexW2808725882WikidataQ129627149 ScholiaQ129627149MaRDI QIDQ1755961
Avik Chakraborti, Mridul Nandi, Nilanjan Datta
Publication date: 11 January 2019
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2017-0011
Data encryption (aspects in computer science) (68P25) Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)
Related Items (3)
\textsf{Light-OCB}: parallel lightweight authenticated cipher with full security ⋮ \textsf{tHyENA}: making \textsf{HyENA} even smaller ⋮ Implicit key-stretching security of encryption schemes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Encryption modes with almost free message integrity
- On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
- INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes
- Extended Generalized Feistel Networks Using Matrix Representation
- Online Ciphers from Tweakable Blockciphers
- An Improved Security Bound for HCTR
- A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
- On Generalized Feistel Networks
- Invertible Universal Hashing and the TET Encryption Mode
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Advances in Cryptology - CRYPTO 2003
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
- Progress in Cryptology - INDOCRYPT 2004
- Information Security and Cryptology
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
- Fast Software Encryption
This page was built for publication: On the optimality of non-linear computations for symmetric key primitives
