Results 91 to 100 of about 1,394 (186)

Rationale for selection round function for the iterative hashing information [PDF]

, 2013
Обосновывается выбор цикловых функций в схеме доказуемо стойкого ключевого универсального хеширования, разрабатываются алгоритмы итеративного ключевого хеширования доказуемой стойкости на основе использования модулярных преобразований.The choice of cycle
Король, Ольга Григорьевна, Пархуць, Любомир Теодорович, Евсеев, Сергей Петрович   +2 more
core   +2 more sources

Universal Vector Commitments [PDF]

We propose a new notion of vector commitment schemes with proofs of (non-)membership that we call universal vector commitments. We show how to build them directly from (i) Merkle commitments, and (ii) a universal accumulator and a plain vector commitment
Samuel Dov Gordon, Daniel McVicker, Ojaswi Acharya, Foteini Baldimtsi, Aayush Yadav   +4 more
core  

Universal hashing functions based on polynomial value computing over rings of integers by modulo 2n [PDF]

, 2012
Запропоновано метод побудування класів універсальних функцій гешування на основі обчислення значення полінома над кільцем цілих чисел за модулем 2n.
A.O. Boiko, А.О. Бойко, А.А. Бойко   +2 more
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

Model of forming of codes of authentification of messages with the use of universal hash functions [PDF]

, 2011
Исследуются методы и модели формирования кодов аутентификации сообщений (МАС – Message Authentication Code), в том числе с использованием универсальных хеширующих функций (UMAC – Message Authentication Code using Universal Hashing).
A.A. Kuznetsov, В.В. Босько, O.G. Korol’, А.А. Кузнецов, О.Г. Король, V.V. Bos'ko, О.О. Кузнецов   +6 more
core  

A PROBABILISTIC STUDY ON COMBINATORIAL EXPANDERS AND HASHING ∗ [PDF]

, 2008
. This paper gives a new way of showing that certain constant degree graphs are graph expanders. This is done by giving new proofs of expansion for three permutations of the Gabber–Galil expander.
Michael, N. Katehakis, Phillip G. Bradford   +2 more
core  

Hashing and the Universal Molecular Identifier

, 2009
The idea of creating a system in which a short sequence of characters can be used in place of a molecular structure traces its roots to the beginnings of modern chemistry. As the Web continues to become the information platform of choice - even in chemistry, the need to communicate molecular information in a Web-ready format increases.
openaire   +1 more source

Bloom filters for molecules. [PDF]

J Cheminform, 2023
Medina J, White AD.
europepmc   +1 more source

Extraction and processing of intensive care chart data from a patient data management system. [PDF]

Front Digit Health
Schrader NB, Meißner B, Fischer P, Röder D, Ertl M, Meybohm P, Schmid B.   +6 more
europepmc   +1 more source

An Advanced Single-Cell RNA Sequencing (scRNA-seq) Protocol Utilizing Custom-Designed Multiplexing. [PDF]

Bio Protoc
Gao F, Liu X, Sun F, Xiao Y, Xiao G, Qu Z.   +5 more
europepmc   +1 more source