Results 41 to 50 of about 115,913 (217)
Наука. Инновации. Технологии, 2022 In the article is developing new theoretical approaches to the construction of the concept of active security on the points of an elliptic curve, which are based on the new scheme of perfect secret sharing on the points of an elliptic curve, permit the ...
Nikolay Ivanovich Chervyakov +4 more
doaj
Fast and Scalable Minimal Perfect Hashing for Massive Key Sets [PDF]
, 2017 Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to high ...
Chikhi, Rayan +3 more
core +3 more sources
A new lattice-based password authenticated key exchange scheme with anonymity and reusable key [PDF]
PeerJ Computer ScienceIn this article, we propose a novel bilateral generalization inhomogenous short integer solution (BiGISIS)-based password-authenticated key exchange (PAKE) scheme for post-quantum era security.
Kübra Seyhan, Sedat Akleylek
doaj +2 more sources
Linear time Constructions of some $d$-Restriction Problems [PDF]
, 2014 We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash ...
Bshouty, Nader H.
core +1 more source
Parallel Recursive State Compression for Free [PDF]
, 2011 This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors ...
A. Laarman +14 more
core +6 more sources
Simple, compact and robust approximate string dictionary [PDF]
, 2014 This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\sigma$.
Belazzougui, Djamal, Chegrane, Ibrahim
core +1 more source
A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families
Mathematical Problems in Engineering, 2018 Covering perfect hash families (CPHFs) are combinatorial designs that represent certain covering arrays in a compact way. In previous works, CPHFs have been constructed using backtracking, tabu search, and greedy algorithms.
J. Torres-Jiménez +1 more
semanticscholar +1 more source
Parallel Evaluation of Multi-join Queries [PDF]
, 1995 A number of execution strategies for parallel evaluation of multi-join queries have been proposed in the literature. In this paper we give a comparative performance evaluation of four execution strategies by implementing all of them on the same parallel ...
America R +17 more
core +9 more sources
Quantum Key Distribution with Blind Polarization Bases [PDF]
, 2005 We propose a new quantum key distribution scheme that uses the blind polarization basis. In our scheme the sender and the receiver share key information by exchanging qubits with arbitrary polarization angles without basis reconciliation.
Kim, Chil-Min +3 more
core +1 more source
Finding succinct ordered minimal perfect hash functions [PDF]
Information Processing Letters, 1994 Abstract An ordered minimal perfect hash table is one in which no collisions occur among a predefined set of keys, no space is unused and the data are placed in the table in order. A new method for creating ordered minimal perfect hash functions is presented.
Steven S. Seiden, Daniel S. Hirschberg
openaire +2 more sources