Results 51 to 60 of about 10,475,631 (365)
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
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
Scientific Reports, 2016 Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum ...
Yuguang Yang +4 more
semanticscholar +1 more source
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
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
Key recycling in authentication
, 2014 In their seminal work on authentication, Wegman and Carter propose that to authenticate multiple messages, it is sufficient to reuse the same hash function as long as each tag is encrypted with a one-time pad.
Portmann, Christopher
core +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