Results 21 to 30 of about 44,375 (171)
Software Performance of Universal Hash Functions [PDF]
, 1999 This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a ...
Nevelsteen, W., Preneel, Bart
openaire +2 more sources
Universal Hash Functions from Quantum Procedures
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2020 Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power. However, quantum technologies have advanced considerably during the past years.
Ablayev F.M., Ziatdinov M.T.
openaire +2 more sources
On Length Independent Security Bounds for the PMAC Family
IACR Transactions on Symmetric Cryptology, 2021 At FSE 2017, Gaži et al. demonstrated a pseudorandom function (PRF) distinguisher (Gaži et al., ToSC 2016(2)) on PMAC with Ω(lq2/2n) advantage, where q, l, and n, denote the number of queries, maximum permissible query length (in terms of n-bit blocks ...
Bishwajit Chakraborty +3 more
doaj +1 more source
Regular and almost universal hashing: an efficient implementation [PDF]
, 2016 Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the ...
Ignatchenko, Sergey +2 more
core +2 more sources
Strongly universal string hashing is fast [PDF]
, 2014 We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular ...
Kaser, Owen, Lemire, Daniel
core +2 more sources
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF
IACR Transactions on Symmetric Cryptology, 2018 SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely PMAC_Plus (Yasuda, CRYPTO 2011), 3kf9 (Zhang et al ...
Nilanjan Datta +3 more
doaj +1 more source
Energy-efficient pipelined bloom filters for network intrusion detection [PDF]
, 2006 This document is made available in accordance with publisher policies. Please cite only the published version using the reference above.
Kaya, I, Kocak, T
core +3 more sources
Transparent code authentication at the processor level [PDF]
, 2009 The authors present a lightweight authentication mechanism that verifies the authenticity of code and thereby addresses the virus and malicious code problems at the hardware level eliminating the need for trusted extensions in the operating system.
A.O. Durahim +32 more
core +2 more sources
On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes [PDF]
, 2013 . Universal hash functions are commonly used primitives for fast and secure message authentication in the form of Message Authentication Codes (MACs) or Authenticated Encryption with Associated Data (AEAD) schemes.
B Boer den +22 more
core +8 more sources
مجلة بغداد للعلوم, 2020 The widespread use of the Internet of things (IoT) in different aspects of an individual’s life like banking, wireless intelligent devices and smartphones has led to new security and performance challenges under restricted resources.
Firas Ghanim Tawfeeq, Alaa M. Abdul-Hadi
doaj +1 more source