Open problems in hash function security
A cryptographic hash function compresses arbitrarily long messages to digests of a short
and fixed length. Most of existing hash functions are designed to evaluate a compression …
and fixed length. Most of existing hash functions are designed to evaluate a compression …
Optimal collision security in double block length hashing with single length key
B Mennink - International Conference on the Theory and …, 2012 - Springer
The idea of double block length hashing is to construct a compression function on 2 n bits
using a block cipher with an n-bit block size. All optimally secure double length hash …
using a block cipher with an n-bit block size. All optimally secure double length hash …
Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
Y Naito - … Conference on Cryptology and Information Security in …, 2019 - Springer
Existing double-block-length (DBL) hash functions, in order to achieve optimal
indifferentiable security (security up to O (2^ n) O (2 n) query complexity), require a block …
indifferentiable security (security up to O (2^ n) O (2 n) query complexity), require a block …
AES-based CCR Hash with High Security and Its Application to Zero-Knowledge Proofs
The recent VOLE-based interactive zero-knowledge (VOLE-ZK) protocols along with non-
interactive zero-knowledge (NIZK) proofs based on MPC-in-the-Head (MPCitH) and VOLE …
interactive zero-knowledge (NIZK) proofs based on MPC-in-the-Head (MPCitH) and VOLE …
Multiplex: TBC-based Authenticated Encryption with Sponge-Like Rate
Authenticated Encryption (AE) modes of operation based on Tweakable Block Ciphers
(TBC) usually measure efficiency in the number of calls to the underlying primitive per …
(TBC) usually measure efficiency in the number of calls to the underlying primitive per …
Optimal collision security in double block length hashing with single length key
B Mennink - Designs, Codes and Cryptography, 2017 - Springer
The idea of double block length hashing is to construct a compression function on 2 n bits
using a block cipher with an n-bit block size. All optimally secure double block length hash …
using a block cipher with an n-bit block size. All optimally secure double block length hash …
An efficient construction of a compression function for cryptographic hash
A cryptographic hash\left (CH\right) is an algorithm that invokes an arbitrary domain of the
message and returns fixed size of an output. The numbers of application of cryptographic …
message and returns fixed size of an output. The numbers of application of cryptographic …
[PDF][PDF] Design, Analysis, and Implementation of Symmetric-key (Authenticated) Ciphers
E List - 2021 - db-thueringen.de
Abstract Modern Cryptography. Modern cryptography has become an often ubiquitous but
essential part of our daily lives. Protocols for secure authentication and encryption protect …
essential part of our daily lives. Protocols for secure authentication and encryption protect …
[PDF][PDF] Analysis Design & Applications of Cryptographic Building Blocks
C Forler - 2015 - core.ac.uk
This thesis deals with the basic design and rigorous analysis of cryptographic schemes and
primitives, especially of authenticated encryption schemes, hash functions, and password …
primitives, especially of authenticated encryption schemes, hash functions, and password …
[PDF][PDF] Design and Analysis of Cryptographic Algorithms for Authentication
J Wenzel - crypto day matters 30, 2019 - dl.gi.de
During the previous decades, the upcoming demand for security in the digital world, eg, the
Internet, lead to numerous groundbreaking research topics in the field of cryptography. The …
Internet, lead to numerous groundbreaking research topics in the field of cryptography. The …