Results 31 to 40 of about 1,402 (165)
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
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
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
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
Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing [PDF]
, 2010 In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role.
Akın, Abdulkadir +6 more
core +2 more sources
Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization
EURASIP Journal on Advances in Signal Processing, 2018 The complexity of agent localization increases significantly when unique identification of the agents is not possible. Corresponding application cases include multiple-source localization, in which the agents do not have identification sequences at all ...
Stephan Schlupkothen +2 more
doaj +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
Security of Even–Mansour Ciphers under Key-Dependent Messages
IACR Transactions on Symmetric Cryptology, 2017 The iterated Even–Mansour (EM) ciphers form the basis of many blockcipher designs. Several results have established their security in the CPA/CCA models, under related-key attacks, and in the indifferentiability framework. In this work, we study the Even–
Pooya Farshim +2 more
doaj +1 more source
EURASIP Journal on Advances in Signal Processing, 2018 In the localization of wireless agents, ambiguous measurements have significant implications regarding the complexity and quality of the agents’ positioning.
Stephan Schlupkothen, Gerd Ascheid
doaj +1 more source
Sufficient conditions for sound tree hashing modes [PDF]
, 2009 We consider the general case of tree hashing modes that make use of an underlying compression function. We consider such a tree hashing mode sound if differentiating it from a random oracle, assuming the underlying compression function is a random oracle
+3 more
core +1 more source