Results 41 to 50 of about 154,141 (333)
EliMAC: Speeding Up LightMAC by around 20%
IACR Transactions on Symmetric Cryptology, 2023 Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are ...
Christoph Dobraunig +2 more
doaj +1 more source
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence
, 2013 Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core +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
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract This research focuses on addressing the privacy issues in healthcare advancement monitoring with the rapid establishment of the decentralised communication system in the Internet of Medical Things (IoMT). An integrated blockchain homomorphic encryption standard with an in‐build supervised learning‐based smart contract is designed to improvise ...
Chandramohan Dhasarathan +7 more
wiley +1 more source
Extended integer tent maps and dynamic hash function
Tongxin xuebao, 2010 Based on the analysis of uniform distribution property of the extended integer tent maps,a novel dynamic hash function with the output length of 160bit was constructed.In addition,the MD structure was improved so that the capacity of collision resistance
LIU Jian-dong
doaj +2 more sources
A Fast Single-Key Two-Level Universal Hash Function
IACR Transactions on Symmetric Cryptology, 2017 Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty +2 more
doaj +1 more source
HMNT: Hash Function Based on New Mersenne Number Transform
IEEE Access, 2020 In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient ...
Ali Maetouq, Salwani Mohd Daud
doaj +1 more source
Byzantine Modification Detection in Multicast Networks With Random Network Coding [PDF]
, 2008 An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as ...
Effros, Michelle +5 more
core +1 more source
Ranking-Based Deep Hashing Network for Image Retrieval
IEEE Access, 2022 In large-scale image retrieval, the deep learning-based hashing methods have significantly progressed. However, most of the existing deep hashing methods still have the problems of low feature learning efficiency and weak ranking relationship ...
Zhisheng Zhang +5 more
doaj +1 more source
Designing Physical Unclonable Functions From Optically Active Materials
Advanced Materials, EarlyView.Assigning unforgeable “fingerprints” to manufactured goods is a key strategy to fight global counterfeiting. Optical physical unclonable functions (PUFs) are chemically generated random patterns of optically active materials serving as unique authenticators.
Maxime Klausen +2 more
wiley +1 more source