Results 81 to 90 of about 1,492,941 (204)
Hash Tables as Engines of Randomness at the Limits of Computation: A Unified Review of Algorithms
AlgorithmsHash tables embody a paradox of deterministic structure that emerges from controlled randomness. They have evolved from simple associative arrays into algorithmic engines that operate near the physical and probabilistic limits of computation. This review
Paul A. Gagniuc, Mihai Togan
doaj +1 more source
IEEE Open Journal of the Communications SocietyThe proliferation of Internet of Things (IoT) devices in cloud-assisted environments raises urgent concerns regarding fine-grained access control, policy privacy, and resilience against quantum adversaries.
Potchakorn Poomekum +2 more
doaj +1 more source
Approximate Quantum Error Correction with 1D Log-Depth Circuits
PRX QuantumEfficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies.
Guoding Liu +3 more
doaj +1 more source
On the concept of quantum hashing
Математические вопросы криптографии, 2016 Понятие квантового хеширования вводится как естественное обобщение классического хеширования. Предлагаются определение квантового хеширующего генератора и способ построения большого числа различных квантовых хеширующих функций. Построение основано на композиции классического $\varepsilon$-универсального семейства и заданного семейства функций ...
Ablayev, F. M., Ablayev, M. F.
openaire +3 more sources
NeonCROSS: Vectorized Implementation of Post-Quantum Signature CROSS on Cortex-A72 and Apple M3
Transactions on Cryptographic Hardware and Embedded SystemsThe advancement of quantum computing threatens traditional public-key cryptographic systems, prompting the development of post-quantum cryptography (PQC).
Hanyu Wei, Wenqian Li, Yunlei Zhao
doaj +1 more source
Improved Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
IACR Transactions on Symmetric CryptologyThe Nostradamus attack was originally proposed as a security vulnerability for a hash function by Kelsey and Kohno at EUROCRYPT 2006. It requires the attacker to commit to a hash value y of an iterated hash function H.
Xiaoyang Dong +4 more
doaj +1 more source
Quantum Hashing via Classical $\epsilon$-universal Hashing Constructions
, 2014 In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical $\epsilon$-universal hash family and a given family of functions -- quantum hash generator.
Ablayev, Farid, Ablayev, Marat
openaire +1 more source
From graphs to keyed quantum hash functions
Lobachevskii Journal of Mathematics, 2016 We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed quantum hash function based on extractor function that can be used in quantum message authentication codes and assess ...
openaire +4 more sources
A Lightweight Variant of Falcon for Efficient Post-Quantum Digital Signature
InformationConventional public-key cryptographic systems are increasingly threatened by advances in quantum computing, accelerating the need for robust post-quantum cryptographic solutions.
Aigerim Kerimbayeva +6 more
doaj +1 more source