Results 41 to 50 of about 1,492,941 (204)
Developing a New Collision-Resistant Hashing Algorithm
Today, cryptographic hash functions have numerous applications in different areas. At the same time, new collision attacks have been developed recently, making some widely used algorithms like SHA-1 vulnerable and unreliable.
Larissa V. Cherckesova +3 more
doaj +1 more source
Side-Channel Protections for Picnic Signatures
We study masking countermeasures for side-channel attacks against signature schemes constructed from the MPC-in-the-head paradigm, specifically when the MPC protocol uses preprocessing.
Diego F. Aranha +6 more
doaj +1 more source
Fully-Parallel Quantum Turbo Decoder
Quantum turbo codes (QTCs) are known to operate close to the achievable Hashing bound. However, the sequential nature of the conventional quantum turbo decoding algorithm imposes a high decoding latency, which increases linearly with the frame length ...
Zunaira Babar +7 more
doaj +1 more source
Quantum hash function based on controlled alternate lively quantum walks
AbstractQuantum hash function is an important area of interest in the field of quantum cryptography. Quantum hash function based on controlled alternate quantum walk is a mainstream branch of quantum hash functions by virtue of high efficiency and flexibility.
Penglin Hou +4 more
openaire +3 more sources
A Probability‐Aware AI Framework for Reliable Anti‐Jamming Communication
ABSTRACT Adversarial jamming attacks have increased on communication systems, causing distortion and threatening transmissions. Typical attacks rely on traditional, well‐defined cryptographic protocols and frequency‐hopping techniques. Nevertheless, these techniques become vulnerable when facing intelligent jammers.
Tawfeeq Shawly, Ahmed A. Alsheikhy
wiley +1 more source
Quantum error correction near the coding theoretical bound
Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits1.
Daiki Komoto, Kenta Kasai
doaj +1 more source
Topological Quantum Hashing with the Icosahedral Group [PDF]
We study an efficient algorithm to hash any single-qubit gate into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudogroups.
M. BURRELLO +3 more
openaire +2 more sources
Abstract Background Computed tomography (CT) examinations of the head, paranasal sinus (PNS), and cervical spine (C‐spine) are frequently performed in emergency settings, raising concerns about radiation exposure to the radiosensitive eye lens. Overexposure can cause radiation‐induced ocular damage.
Sowitchaya Huakham +4 more
wiley +1 more source
Chosen-Prefix Collisions on AES-like Hashing
Chosen-prefix collision (CPC) attack was first presented by Stevens, Lenstra and de Weger on MD5 at Eurocrypt 2007. A CPC attack finds a collision for any two chosen prefixes, which is a stronger variant of collision attack. CPCs are naturally harder to
Shiyao Chen +3 more
doaj +1 more source
Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects
. Rusins Freivalds was one of the first researchers who introduced methods (later called fingerprinting) for constructing efficient classical randomized and quantum algorithms. Fingerprinting and cryptographic hashing have quite different usages in computer
F. Ablayev +3 more
semanticscholar +1 more source

