Results 11 to 20 of about 44,375 (171)
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 +4 more sources
Fast AES-Based Universal Hash Functions and MACs
IACR Transactions on Symmetric CryptologyUltra-fast AES round-based software cryptographic authentication/encryption primitives have recently seen important developments, fuelled by the authenticated encryption competition CAESAR and the prospect of future high-profile applications such as ...
Augustin Bariant +5 more
doaj +6 more sources
Corrigendum to Fast AES-Based Universal Hash Functions and MACs
IACR Transactions on Symmetric CryptologyIn ToSC 2024(2), Bariant et al. proposed a new framework for designing efficient AES-based Universal Hash Functions (UHFs) and Message Authentification Codes (MACs).
Augustin Bariant +5 more
doaj +2 more sources
On an almost-universal hash function family with applications to authentication and secrecy codes [PDF]
International Journal of Foundations of Computer Science, 2017 Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH$^*$, which was shown to be $\Delta$-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function family.
Bibak, Khodakhast +3 more
core +5 more sources
Accelerating Multiparametric Quantitative MRI Using Self-Supervised Scan-Specific Implicit Neural Representation With Model Reinforcement. [PDF]
Magn Reson MedABSTRACT Purpose To develop a self‐supervised scan‐specific deep learning framework for reconstructing accelerated multiparametric quantitative MRI (qMRI). Methods We propose REFINE‐MORE (REference‐Free Implicit NEural representation with MOdel REinforcement), combining an implicit neural representation (INR) architecture with a model reinforcement ...
Feng R, Jang A, He X, Liu F.
europepmc +2 more sources
Construction of universal one-way hash functions: Tree hashing revisited [PDF]
Discrete Applied Mathematics, 2007 AbstractWe present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t⩾2, our algorithm extends the domain from the set of all n-bit strings to the set of all ((2t-1)(n-m)+m)-bit strings, where m is the length of the message digest. The associated increase in key length is 2m bits for t=2;
Haitner, Iftach +4 more
openaire +5 more sources
Lightweight MACs from Universal Hash Functions [PDF]
, 2020 Lightweight cryptography is a topic of growing importance, with the goal to secure the communication of low-end devices that are not powerful enough to use conventional cryptography. There have been many recent proposals of lightweight block ciphers, but comparatively few results on lightweight Message Authentication Codes (MACs). Therefore, this paper
Duval, Sébastien, Leurent, Gaëtan
openaire +2 more sources
Universal classes of hash functions
Journal of Computer and System Sciences, 1979 AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
Larry Carter, Mark N. Wegman
openaire +2 more sources
IEEE Transactions on Quantum Engineering, 2022 The quantum key distribution (QKD) network with Vernam's one-time pad encryption and secret sharing are powerful security tools to realize an information theoretically secure (ITS) distributed storage system.
Mikio Fujiwara +5 more
doaj +1 more source
Faster 64-bit universal hashing using carry-less multiplications [PDF]
, 2015 Intel and AMD support the Carry-less Multiplication (CLMUL) instruction set in their x64 processors. We use CLMUL to implement an almost universal 64-bit hash family (CLHASH).
Kaser, Owen, Lemire, Daniel
core +2 more sources