Results 91 to 100 of about 1,492,941 (204)

Quantum hashing with the icosahedral group

, 2009
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) 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 pseudo-groups.
Burrello, Michele, Xu, Haitan, Mussardo, Giuseppe, Wan, Xin   +3 more
openaire   +2 more sources

Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1

Computers
The distinguishing feature of hash-based algorithms is their high confidence in security. When designing electronic signature schemes, proofs of security reduction to certain properties of cryptographic hash functions are used.
Kunbolat Algazy, Kairat Sakan, Ardabek Khompysh, Dilmukhanbet Dyusenbayev   +3 more
doaj   +1 more source

Improved Quantum Rebound Attacks on Double Block Length Hashing with Round-Reduced AES-256 and ARIA-256

IACR Transactions on Symmetric Cryptology
At EUROCRYPT 2020, Hosoyamada and Sasaki proposed the first dedicated quantum collision attacks on hash functions. Their proposal presented a quantum adaptation of the rebound attack and revealed that differential trails, which have too low probability ...
Dongjae Lee, Seokhie Hong
doaj   +1 more source

AI-Enhanced Perceptual Hashing with Blockchain for Secure and Transparent Digital Copyright Management

Cryptography
This study presents a novel framework for digital copyright management that integrates AI-enhanced perceptual hashing, blockchain technology, and digital watermarking to address critical challenges in content protection and verification.
Zhaoxiong Meng, Rukui Zhang, Bin Cao, Meng Zhang, Yajun Li, Huhu Xue, Meimei Yang   +6 more
doaj   +1 more source

Ternary LWE Key Search: A New Frontier for Quantum Combinatorial Attacks

Information
The Learning with Errors (LWE) problem, particularly its efficient ternary variant where secrets and errors are small, is a fundamental building block for numerous post-quantum cryptographic schemes.
Yang Li
doaj   +1 more source

Fault-tolerant quantum memory using low-depth random circuit codes

Physical Review Research
Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.
Jon Nelson, Gregory Bentsen, Steven T. Flammia, Michael J. Gullans   +3 more
doaj   +1 more source

Comparative Study of ASE-ASE and ASE-Laser Based Quantum Random Number Generators

IEEE Photonics Journal
Quantum random number generators (QRNG) based on amplified spontaneous emission (ASE) are known to achieve multi-gigabit-per-second rates through high-speed sampling of intensity and phase fluctuations.
Shreyam Maity, Asish Prosad, Harinee Natarajan, V. Balaswamy, Varun Raghunathan   +4 more
doaj   +1 more source

Enhancing Security and Authenticity in Immersive Environments

Information
Immersive environments have brought a great transformation in human–computer interaction by enabling realistic and interactive experiences within simulated or augmented spaces.
Rebecca Acheampong, Dorin-Mircea Popovici, Titus Balan, Alexandre Rekeraho, Manuel Soto Ramos   +4 more
doaj   +1 more source

A Quantum-Resistant Photonic Hash Function

9+3 pages, 5+2 ...
Hatanaka, Tomoya, Fushio, Rikuto, Watanabe, Masataka, Munro, William J., Ikeda, Tatsuhiko N., Sugiura, Sho   +5 more
openaire   +2 more sources

Efficient Equivalent of Shallow Quantum Hashing

Quantum hashing is a widely used technique in quantum computation that allows us to design space-efficient algorithms and protocols. Recently, Vasiliev has shown that the phase form of shallow quantum hashing can be implemented by a circuit of depth 2.
Zinnatullin, Ilnar, Vasiliev, Alexander
openaire   +2 more sources