Results 61 to 70 of about 983,384 (170)
A2—codes from universal hash classes [PDF]
, 1995 We describe a general method to construct codes for unconditional authentication with arbitration (A2-codes), which protect not only against outside opponents but also against certain types of frauds from the receiver and transmitter. The constructions are based on orthogonal arrays and universal hash classes.
openaire +2 more sources
Preimage Attack on Parallel FFT-Hashing
, 2008 Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multi-permutation which helps in proving its resistance to collision attacks.
Abstract Parallel +2 more
core
A Trade-Off Between Collision Probability and Key Size in Universal Hashing Using Polynomials [PDF]
, 2009 Let $\rF$ be a finite field and suppose that a single element of $\rF$ is used as an authenticator (or tag). Further, suppose that any message consists of at most $L$ elements of $\rF$.
Palash Sarkar
core +1 more source
Applications of Universal Hashing in Complexity Theory
, 2007 The aim of this tutorial article is to provide an introduction to methods based on universal hashing in the area of randomized computation.
V. Arvind, M. Mahajan
core
On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes
, 1996 In this primarily expository paper, we discuss the connections between two popular and useful tools in theoretical computer science, namely, universal hashing and pairwise independent random variables; and classical combinatorial stuctures such as error ...
D. R. Stinson
core
Unconditional authentication with universal hashing on the maximal curves [PDF]
, 2013 Представлено решение задачи построения безусловной аутентификации с универсальным хешированием по максимальным кривым в композиционной схеме с ортогональными и слабо смещенными массивам.Представлено рішення задачі побудови безумовної автентифікації з ...
Г.З. Халимов +2 more
core
Spectral Embedded Hashing for Scalable Image Retrieval
, 2014 We propose a new graph based hashing method called spectral embedded hashing (SEH) for large-scale image retrieval. We first introduce a new regularizer into the objective function of the recent work spectral hashing to control the mismatch between the
Chen, L +8 more
core +1 more source
The Message Authentication Code Based on Universal Hashing
, 2012 The article covers the research of message authentication codes based on universal hashing. The new message authentication code algorithm is described here.
A. U. Nesterenko, T. A. Bilyk
core
Iterative Universal Hash Function Generator for Minhashing
CoRR, 2014 Minhashing is a technique used to estimate the Jaccard Index between two sets by exploiting the probability of collision in a random permutation. In order to speed up the computation, a random permutation can be approximated by using an universal hash function such as the $h_{a,b}$ function proposed by Carter and Wegman.
openaire +2 more sources
LATIN IS THE UNIVERSAL LANGUAGE AND ITS BENEFITS OF LEARNING
, 2023 The article deals with the phenomenon of Latin as a universal cultural code that continues to be actively used in various spheres of life. Knowledge of Latin not only facilitates the study of many languages, but also allows to attach oneself to the world
Tuychieva Odina
core