Results 281 to 290 of about 209,510 (304)
Error correcting codes and collision-resistant hashing [PDF]
Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253), 2003 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
Generic Groups, Collision Resistance, and ECDSA
Designs, Codes and Cryptography, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 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
The role of inelastic collisions in plasma resistivity [PDF]
International Conference on Plasma Sciences (ICOPS), 1993 Summary form only given. The influence of inelastic electron-ion interactions (collisional excitation and deexcitation, collisional ionization, and three-body recombination) on plasma resistivity, particularly in dense plasma, has been studied. In Spitzer's theory of low-density plasma resistivity only elastic electron-ion collisions are considered. In
openaire +1 more source
Collision Resistant Double-Length Hashing
2010We give collision resistance bounds for blockcipher based, double-call, double-length hash functions using (k, n)-bit blockciphers with k > n. Ozen and Stam recently proposed a framework [21] for such hash functions that use 3n-to-2n-bit compression functions and two parallel calls to two independent blockciphers with 2n-bit key and n-bit block size.
Stefan Lucks +3 more
openaire +2 more sources
Proceedings of the 17th annual international conference on Mobile computing and networking, 2011 Efficiently sharing spectrum among multiple users is critical to wireless network performance. In this paper, we propose a novel spectrum sharing protocol called Collision-Resistant Multiple Access (CRMA) to achieve high efficiency. In CRMA, each transmitter views the OFDM physical layer as multiple orthogonal but sharable channels, and independently ...
Mi Kyung Han +6 more
openaire +1 more source
Generalized Compact Knapsacks Are Collision Resistant
2006In (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 +2 more sources