Results 291 to 300 of about 279,849 (339)
A Lightweight Accountable Parallel Blockchain Architecture Based on Redactable Blockchain for Agri-Food Traceability. [PDF]
Chen F, Zhao C, Yang X, Luo N, Sun C.
europepmc +1 more source
Performance Evaluation of a Mesh-Topology LoRa Network. [PDF]
Durand TG, Booysen MJ.
europepmc +1 more source
Dynamics of polymers in coarse-grained nematic solvents.
Valei ZK+5 more
europepmc +1 more source
Error correcting codes and collision-resistant hashing [PDF]
This extended abstract proposes a general construction for fast and secure nm-bit collision-resistant compression functions based on error-correcting codes and m-bit collision-resistant compression functions. This leads to simple and practical hash function constructions based on block ciphers such as DES and AES. Under reasonable assumptions about the
Lars R. Knudsen, Bart Preneel
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Distributional Collision Resistant Hashing
2018Collision resistant hashing is a fundamental concept that is the basis for many of the important cryptographic primitives and protocols. Collision resistant hashing is a family of compressing functions such that no efficient adversary can find any collision given a random function in the family.
Ilan Komargodski, Eylon Yogev
openaire +2 more sources
Atom Collision-Induced Resistivity of Carbon Nanotubes
Science, 2005We report the observation of unusually strong and systematic changes in the electron transport in metallic single-walled carbon nanotubes that are undergoing collisions with inert gas atoms or small molecules. At fixed gas temperature and pressure, changes in the resistance and thermopower of thin films are observed that scale as roughly
Peter C. Eklund+3 more
openaire +3 more sources
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
2018A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a \(x_1 \ne x_2\) s.t. \(h(x_1) = h(x_2)\). Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero ...
Moni Naor, Ilan Komargodski, Eylon Yogev
openaire +2 more sources