Results 171 to 180 of about 1,492,941 (204)
Some of the next articles are maybe not open access.

Reliable hash trees for post-quantum stateless cryptographic hash-based signatures

2015 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFTS), 2015
The potential advent of quantum computers in coming years has motivated security researchers to start developing resistant systems capable of thwarting future attacks, i.e., developing post-quantum cryptographic approaches. Hash-based, code-based, lattice-based, multivariate-quadratic-equations, and secret-key cryptography are all potential candidates,
Mehran Mozaffari-Kermani   +1 more
openaire   +1 more source

Collision Resistance of the OAM-based Quantum Hashing

Lobachevskii Journal of Mathematics, 2023
A. Vasiliev
semanticscholar   +1 more source

Attacking Quantum Hashing. Protocols and Their Cryptanalysis

Lobachevskii Journal of Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Quantum hash function based on continuous quantum walks

Modern Physics Letters A
A method of constructing a quantum hash function (QHF) based on continuous-time quantum walk is proposed, in which the time of quantum walk is controlled by the binary string message, namely, a binary string message as the input of the constructed QHF and the probability value of finally walking to the nodes on the cycle is used as the output of the ...
Wei-Min Shi   +4 more
openaire   +1 more source

On quantum (δ, є)-resistant hashing

Lobachevskii Journal of Mathematics, 2016
© 2016, Pleiades Publishing, Ltd.In the paper we define a notion of quantum resistant ((δ, є)-resistant) hash function which combine together a notion of pre-image (one-way) resistance (δ-resistance) property and the notion of collision resistance (є-resistance) properties.
openaire   +3 more sources

Minimizing collisions for quantum hashing

2017
© Medwell Journals, 2017.Hashing is a widely used technique in computer science. The recently proposed quantum hashing has also proved its usefulness in a number of applications. The key property of both classical and quantum hashing is the ability to withstand collisions however, the notion of collision itself is different in the classical and quantum
Vasiliev A., Latypov M., Ziatdinov M.
openaire   +2 more sources

Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations

Computer Science Symposium in Russia, 2020
F. Ablayev, M. Ablayev, A. Vasiliev
semanticscholar   +1 more source

Quantum guidelines for solid-state spin defects

Nature Reviews Materials, 2021
Gary Wolfowicz   +2 more
exaly  

Home - About - Disclaimer - Privacy