Results 21 to 30 of about 1,013,929 (223)
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.
Jürgen Bierbrauer
openaire +2 more sources
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.
Richard L. Apodaca
openaire +2 more sources
Invertible Universal Hashing and the TET Encryption Mode [PDF]
Annual International Cryptology Conference, 2007 This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using an n-bit block cipher, the resulting scheme can handle input of any bit-length between n and 2n and associated data of arbitrary length.
S. Halevi
openaire +3 more sources
Explicit Wiretap Channel Codes via Source Coding, Universal Hashing, and Distribution Approximation, When the Channels’ Statistics are Uncertain [PDF]
IEEE Transactions on Information Forensics and Security, 2020 We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models.
Rémi A. Chou
semanticscholar +1 more source
EliMAC: Speeding Up LightMAC by around 20%
IACR Transactions on Symmetric Cryptology, 2023 Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are ...
Christoph Dobraunig +2 more
doaj +1 more source
Iterative Universal Hash Function Generator for Minhashing [PDF]
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.
Fabrício Olivetti de França
openaire +3 more sources
EXTENSION OF SSL/TLS FOR QUANTUM CRYPTOGRAPHY [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2008 SSL/TLS is the protocol that is used for the vast majority of secure transactions over the Internet. However, this protocol needs to be extended in order to create a promising platform for the integration of quantum cryptography (QC) into the Internet ...
Sufyan T. Faraj
doaj +1 more source
Secret Key Distillation with Speech Input and Deep Neural Network-Controlled Privacy Amplification
Mathematics, 2023 We propose a new high-speed secret key distillation system via public discussion based on the common randomness contained in the speech signal of the protocol participants.
Jelica Radomirović +3 more
doaj +1 more source
UMAC: Message Authentication Code using Universal Hashing [PDF]
Request for Comments, 2006 Ted Krovetz +10 more
openalex +2 more sources
Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing. [PDF]
PLoS Computational Biology, 2017 With the rapidly increasing volume of deep sequencing data, more efficient algorithms and data structures are needed. Minimizers are a central recent paradigm that has improved various sequence analysis tasks, including hashing for faster read overlap ...
Yaron Orenstein +4 more
doaj +1 more source