Results 21 to 30 of about 1,010 (133)
Sequential Hashing with Minimum Padding
Cryptography, 2018 This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property.
Shoichi Hirose
doaj +1 more source
The suffix-free-prefix-free hash function construction and its indifferentiability security analysis [PDF]
, 2012 In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value (IV) of hash functions is fixed.
Erik Zenner +4 more
core +2 more sources
Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier
Journal of Mathematical Cryptology, 2016 A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them as random functions.
Moody Dustin +2 more
doaj +1 more source
Security Analysis of BLAKE2’s Modes of Operation
IACR Transactions on Symmetric Cryptology, 2016 BLAKE2 is a hash function introduced at ACNS 2013, which has been adopted in many constructions and applications. It is a successor to the SHA-3 finalist BLAKE, which received a significant amount of security analysis.
Atul Luykx, Bart Mennink, Samuel Neves
doaj +1 more source
Efficient computation of hashes [PDF]
, 2014 The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel ...
+16 more
core +3 more sources
Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
IACR Transactions on Symmetric Cryptology, 2018 Cryptographic hashing modes come in many flavors, including Merkle-Damgård with various types of strengthening, Merkle trees, and sponge functions. As underlying primitives, these functions use arbitrary functions, permutations, or block ciphers. In this
Joan Daemen +2 more
doaj +1 more source
A reactive BGK-type model: influence of elastic collisions and chemical interactions [PDF]
, 2005 A BGK‐type model for a reactive multicomponent gas undergoing chemical bimolecular reactions is here presented. The mathematical and physical consistency of the model is stated in detail.
Monaco, Roberto +2 more
core +2 more sources
Subversion Resilient Hashing: Efficient Constructions and Modular Proofs for Crooked Indifferentiability [PDF]
, 2023 We consider the problem of constructing secure cryptographic hash functions from subverted ideal primitives. Hash functions are used to instantiate Random Oracles in cryptographic protocols.
Bhattacharyya, Rishiraj +2 more
core +1 more source
Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]
, 2017 This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core +1 more source
Quantum-secure message authentication via blind-unforgeability [PDF]
, 2020 Formulating and designing unforgeable authentication of classical messages in the presence of quantum adversaries has been a challenge, as the familiar classical notions of unforgeability do not directly translate into meaningful notions in the quantum ...
CH Bennett +17 more
core +3 more sources