SoK: Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields
Poly1305 is a widely-deployed polynomial hash function. The rationale behind its design
was laid out in a series of papers by Bernstein, the last of which dates back to 2005. As …
was laid out in a series of papers by Bernstein, the last of which dates back to 2005. As …
Tweakable HCTR: A BBB secure tweakable enciphering scheme
HCTR, proposed by Wang et al., is one of the most efficient candidates of tweakable
enciphering schemes that turns an n-bit block cipher into a variable input length tweakable …
enciphering schemes that turns an n-bit block cipher into a variable input length tweakable …
Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
A Moch, E List - Applied Cryptography and Network Security: 17th …, 2019 - Springer
The combination of universal hashing and encryption is a fundamental paradigm for the
construction of symmetric-key MACs, dating back to the seminal works by Wegman and …
construction of symmetric-key MACs, dating back to the seminal works by Wegman and …
Length-preserving encryption with HCTR2
P Crowley, N Huckleberry, E Biggers - Cryptology ePrint Archive, 2021 - eprint.iacr.org
On modern processors HCTR is one of the most efficient constructions for building a
tweakable super-pseudorandom permutation. However, a bug in the specification and …
tweakable super-pseudorandom permutation. However, a bug in the specification and …
FAST: disk encryption and beyond
D Chakraborty, S Ghosh, CM López… - Cryptology ePrint …, 2017 - eprint.iacr.org
This work introduces\sym {FAST} which is a new family of tweakable enciphering schemes.
Several instantiations of\sym {FAST} are described. These are targeted towards two goals …
Several instantiations of\sym {FAST} are described. These are targeted towards two goals …
Small Stretch Problem of the DCT Scheme and How to Fix It
Y Chen, T Guo, L Hu, L Shang, S Mao… - Cryptology ePrint …, 2023 - eprint.iacr.org
DCT is a beyond-birthday-bound~(BBB) deterministic authenticated encryption~(DAE) mode
proposed by Forler et al. in ACISP 2016, ensuring integrity by redundancy. The instantiation …
proposed by Forler et al. in ACISP 2016, ensuring integrity by redundancy. The instantiation …
Variants of Wegman-Carter message authentication code supporting variable tag lengths
In this work, we study message authentication code (MAC) schemes supporting variable tag
lengths. We provide a formalisation of such a scheme. Several variants of the classical …
lengths. We provide a formalisation of such a scheme. Several variants of the classical …
Polynomial hashing over prime order fields
This paper makes a comprehensive study of two important strategies for polynomial hashing
over a prime order field Fp, namely usual polynomial based hashing and hashing based on …
over a prime order field Fp, namely usual polynomial based hashing and hashing based on …
Fast Low Level Disk Encryption Using FPGAs
D Chakraborty, S Ghosh, C Mancillas-Lopez… - arXiv preprint arXiv …, 2024 - arxiv.org
A fixed length tweakable enciphering scheme (TES) is the appropriate cryptographic
functionality for low level disk encryption. Research on TES over the last two decades have …
functionality for low level disk encryption. Research on TES over the last two decades have …
On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
Recently, Andreeva et al. showed that online ciphers are actually equivalent to arbitrary
tweak length (ATL) tweakable block ciphers (TBCs). Within this result they gave a security …
tweak length (ATL) tweakable block ciphers (TBCs). Within this result they gave a security …