Results 91 to 100 of about 4,088 (185)
SAT-based preimage attacks on SHA-1
Hash functions are important cryptographic primitives which map arbitrarily long messages to fixed-length message digests in such a way that: (1) it is easy to compute the message digest given a message, while (2) inverting the hashing process (e.g. finding a message that maps to a specific message digest) is hard. One attack against a hash function is
openaire +1 more source
Insecurity of Quantum Blockchains Based on Entanglement in Time. [PDF]
Zawadzki P.
europepmc +1 more source
Pullback Bundles and the Geometry of Learning. [PDF]
Puechmorel S.
europepmc +1 more source
A hybrid hash framework for post quantum secure zero knowledge identification. [PDF]
Bhadane S +3 more
europepmc +1 more source
Code Integrity and Confidentiality: An Active Data Approach for Active and Healthy Ageing. [PDF]
Litvinov E +5 more
europepmc +1 more source
Construction of secure and fast hash functions using nonbinary error-correcting codes [PDF]
Knudsen, Lars Ramkilde, Preneel, Bart
core +1 more source
Post-Quantum Revocable Linkable Ring Signature Scheme Based on SPHINCS+ for V2G Scenarios. [PDF]
Liu S, Du YN, Wang XA, Hu X, Su HE.
europepmc +1 more source
Efficient Linkable Ring Signature Scheme over NTRU Lattice with Unconditional Anonymity. [PDF]
Ye Q, Wang M, Meng H, Xia F, Yan X.
europepmc +1 more source
Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme. [PDF]
Wei Z, Lan G, Zhao H, Li Z, Ju Z.
europepmc +1 more source

