Results 31 to 40 of about 1,394 (186)

Low-power bloom filter architecture for deep packet inspection [PDF]

open access: yes, 2006
Bloom filters are frequently used to identify malicious content like viruses in high speed networks. However, architectures proposed to implement bloom filters are not power efficient.
Kocak, Taskin   +3 more
core   +1 more source

Enhancing Extractable Quantum Entropy in Vacuum-Based Quantum Random Number Generator

open access: yesEntropy, 2018
Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction.
Xiaomin Guo   +5 more
doaj   +1 more source

Lightweight MACs from Universal Hash Functions [PDF]

open access: yes, 2020
Lightweight cryptography is a topic of growing importance, with the goal to secure the communication of low-end devices that are not powerful enough to use conventional cryptography. There have been many recent proposals of lightweight block ciphers, but comparatively few results on lightweight Message Authentication Codes (MACs). Therefore, this paper
Duval, Sébastien, Leurent, Gaëtan
openaire   +2 more sources

Electronic records long term authenticity and integrity demonstration

open access: yesKnjižnica, 2011
Long term preservation of electronic data requires introduction of specific technology solutions and organizational measures in order to provide stable environment for electronic record preservation.
Helena Halas, Aljoša Jerman Blažič
doaj   +1 more source

Improving String Matching through Enhanced Hashing

open access: yesSoftware: Practice and Experience, EarlyView.
ABSTRACT Background Hashing offers opportunities to tune string matching algorithms while enabling efficient data retrieval and pattern detection. Many of the best algorithms apply hashing. Objective We try to develop faster online algorithms for exact string matching.
Francesco Pio Marino, Jorma Tarhio
wiley   +1 more source

Unconditionally secure authentication for quantum key distribution [PDF]

open access: yes, 2011
This work describes the using of Universal and Strongly Universal classes of hash functions for unconditionally secure message authentication in quantum cryptogra- phy.
Calimani, Simon
core  

AuCPace: Efficient verifier-based PAKE protocol tailored for the IIoT

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2019
Increasingly connectivity becomes integrated in products and devices that previously operated in a stand-alone setting. This observation holds for many consumer applications in the so-called "Internet of Things" (IoT) as well as for corresponding ...
Björn Haase, Benoît Labrique
doaj   +1 more source

Recursive Grid Indexing for Fast Non‐Uniform Quantization Without Binary Search

open access: yesSoftware: Practice and Experience, EarlyView.
ABSTRACT Purpose To present Recursive Grid Indexing (RGI), a practical software technique for accelerating non‐uniform quantization and predecessor queries without relying on binary search at any stage. Design/Methodology/Approach RGI replaces conventional logarithmic binary search with a recursive, low‐branching grid structure. The method constructs a
Oswaldo Cadenas
wiley   +1 more source

A secured cloud‐medical data sharing with A‐BRSA and Salp ‐Ant Lion Optimisation Algorithm

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
Abstract Sharing medical data among healthcare providers, researchers, and patients is crucial for efficient healthcare services. Cloud‐assisted smart healthcare (s‐healthcare) systems have made it easier to store EHRs effectively. However, the traditional encryption algorithms used to secure this data can be vulnerable to attacks if the encryption key
Adel Binbusayyis   +7 more
wiley   +1 more source

Properties of universal hashing [PDF]

open access: yes, 2013
The aim of this work is to create a model of hashing with an acceptable worst case time complexity. The model is based on the idea of universal hashing and the expected time of every operation is constant.
Babka, Martin
core  

Home - About - Disclaimer - Privacy