Results 41 to 50 of about 17,753 (215)

Software Performance of Universal Hash Functions [PDF]

open access: yes, 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   +3 more sources

On an almost-universal hash function family with applications to authentication and secrecy codes [PDF]

open access: yes, 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   +1 more source

One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers [PDF]

open access: yes, 2019
Sketches are probabilistic data structures that can provide approximate results within mathematically proven error bounds while using orders of magnitude less memory than traditional approaches.
G Cormode   +9 more
core   +2 more sources

Securing Generative Artificial Intelligence with Parallel Magnetic Tunnel Junction True Randomness

open access: yesAdvanced Intelligent Systems, EarlyView.
True random numbers can protect generative artificial intelligence (GAI) models from attacks. A highly parallel, spin‐transfer torque magnetic tunnel junction‐based system is demonstrated that generates high‐quality, energy‐efficient random numbers.
Youwei Bao, Shuhan Yang, Hyunsoo Yang
wiley   +1 more source

Hash the Universe: Differentially Private Text Extraction with Feature Hashing

open access: yes, 2022
Abstract Using artificial intelligence for text extraction can often require handling privacy-sensitive text. To avoid revealing confidential information, data owners and practitioners can use differential privacy, a definition of privacy with provable guarantees.
Sam Fletcher   +2 more
openaire   +1 more source

Harnessing Blockchain for Sustainable Business Strategy: A Case Study on Enhancing Accounting Practices

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT This study explores the practical application of blockchain technology in accounting through a single case study of TLAB SCF, an Italian financial consulting firm actively involved in national and European digital innovation initiatives. The research adopts the technology acceptance model to investigate how perceived usefulness and perceived ...
Paolo Pietro Biancone   +3 more
wiley   +1 more source

Leftover Hashing Against Quantum Side Information

open access: yes, 2010
The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random.
Renner, Renato   +3 more
core   +1 more source

A Case-Based Reasoning Method for Locating Evidence During Digital Forensic Device Triage [PDF]

open access: yes, 2014
The role of triage in digital forensics is disputed, with some practitioners questioning its reliability for identifying evidential data. Although successfully implemented in the field of medicine, triage has not established itself to the same degree in ...
Horsman, Graeme   +2 more
core   +1 more source

The Impact of Environmental Information on Cryptocurrency Investment Allocation Decisions: An Experimental Survey Study

open access: yesCorporate Social Responsibility and Environmental Management, EarlyView.
ABSTRACT Despite the universal acknowledgment of financial profit expectations as an investment driver, environmental concern has been suggested as a factor influencing investors' decisions to purchase cryptocurrency. In this sense, this study investigates the impact of environmental information on investment allocation decisions to purchase different ...
Moritz Wendl   +2 more
wiley   +1 more source

Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence

open access: yes, 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

Home - About - Disclaimer - Privacy