Results 211 to 220 of about 51,869 (259)

Plasmid transfer and loss probabilities interactively determine antibiotic resistance spread in surface-associated bacterial biomass

Ramoneda J, Vinod DP, Ma Y, Ruan C, Schmidt J, Manhart M, Angst DC, Johnson DR.   +7 more
europepmc   +1 more source

Materials Used in Electric Vehicle Battery Housings: Recycling Pathways and Circular Design-A Review. [PDF]

Materials (Basel)
Bazan P, Przybek A, Łach M, Badura K, Duda P, Bielaczyc P.   +5 more
europepmc   +1 more source

Gram-to-Ton Synthesis of Single-Atom Materials via Low-Hydroxyl-Coverage Surface Collision. [PDF]

Adv Mater
Hu L, Zhang H, Yao Y, Zhan G, Pei H, Zu J, Zhou B, Li S, Mao C, Shen J, Wang X, Yang Y, Zhang L.   +12 more
europepmc   +1 more source

Systematic Evaluation of Biologically Inspired Motion Detection Models: From LGMD and EMD to Hybrid Spiking Neural Networks. [PDF]

Biomimetics (Basel)
Ndiangang V, Liu P.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Collision Resistance of the OAM-based Quantum Hashing

Lobachevskii Journal of Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A V Vasiliev
exaly   +2 more sources

On Distributional Collision Resistant Hashing

2018
Collision 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   +3 more sources

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions

2018
A 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 ...
Ilan Komargodski, Moni Naor, Eylon Yogev
openaire   +3 more sources

Generalized Compact Knapsacks Are Collision Resistant

2006
In (Micciancio, FOCS 2002), it was proved that solving the generalized compact knapsack problem on the average is as hard as solving certain worst-case problems for cyclic lattices. This result immediately yielded very efficient one-way functions whose security was based on worst-case hardness assumptions. In this work, we show that, while the function
Vadim Lyubashevsky, Daniele Micciancio
openaire   +3 more sources

Generic Groups, Collision Resistance, and ECDSA

Designs, Codes and Cryptography, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Atom Collision-Induced Resistivity of Carbon Nanotubes

Science, 2005
We 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
Hugo E, Romero, Kim, Bolton, Arne, Rosén, Peter C, Eklund   +3 more
openaire   +2 more sources