Results 1 to 10 of about 20,020 (255)

High-Throughput and Memory-Efficient Pipeline Key-Value Store Architecture on FPGA. [PDF]

Micromachines (Basel)
Wang X, Liu L, Li Y.
europepmc   +1 more source

Two secure authentication protocols for mitigating vulnerabilities in IoD. [PDF]

Sci Rep
Safkhani M, Ghorbani Fard M.
europepmc   +1 more source

A Kyber-Based Lightweight Cloud-Assisted Authentication Scheme for Medical IoT. [PDF]

Sensors (Basel)
Yan H, Wang Z, Lin L, Sun J, Liu S.
europepmc   +1 more source

Knowledge-based optimization algorithm for feature selection in promoting circular economy through blockchain. [PDF]

Sci Rep
Sridevi S, Kumar BV, Karpagam GR.
europepmc   +1 more source

Image Encryption Algorithm Based on a New Two-Dimensional Chaotic System and Rotating Dial Model. [PDF]

Entropy (Basel)
Zhang X, Hu H.
europepmc   +1 more source

Gungnir codec enabling high error-tolerance and low-redundancy DNA storage through substantial computing power. [PDF]

Nat Commun
Zhang J, Chen L, Sun J, Li S, Zhou Y, Wu Z, Li C, Zheng Z, Luo R.   +8 more
europepmc   +1 more source

On the equivalence between classically verifiable position verification and certified randomness. [PDF]

Nat Commun
Kaleoglu F, Liu M, Cui D, Amer O, Pistoia M, Lim C, Chakraborty K.   +6 more
europepmc   +1 more source

Linear hash functions

Journal of the ACM, 1999
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos   +4 more
openaire   +2 more sources

MGR Hash Functions

Cryptologia, 2019
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi, Dhananjoy Dey, Prasanna Raghaw Mishra 0001, Bal Kishan Dass   +3 more
openaire   +1 more source

Learning to hash: forgiving hash functions and applications

Data Mining and Knowledge Discovery, 2008
The problem of efficiently finding similar items in a large corpus of high-dimensional data points arises in many real-world tasks, such as music, image, and video retrieval. Beyond the scaling difficulties that arise with lookups in large data sets, the complexity in these domains is exacerbated by an imprecise definition of similarity. In this paper,
Shumeet Baluja, Michele Covell
openaire   +1 more source