Results 281 to 290 of about 215,056 (305)
Some of the next articles are maybe not open access.
Collision Resistance of the OAM-based Quantum Hashing
Lobachevskii Journal of Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Generic Groups, Collision Resistance, and ECDSA
Designs, Codes and Cryptography, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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 +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.
Ewan Fleischmann +3 more
openaire +1 more source
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 ...
Ilan Komargodski, Moni Naor, Eylon Yogev
openaire +1 more source
Collision resistance of orthogonally stiffened shell structures
Journal of Constructional Steel Research, 1988Abstract Detailed results are given of an experimental investigation into the response of stiffened cylinders to accidental lateral loading. Damage is applied using a knife edge indenter positioned at mid-span. Observations suggest a mechanism by which the light ring frames deform and membrane tension develops in the longitudinal stiffeners.
B.F. Ronalds, P.J. Dowling
openaire +1 more source
Error correcting codes and collision-resistant hashing
Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253), 2003This 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
L.R. Knudsen, B. Preneel
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 +1 more source
Improving performance of wireless networks using collision resistent modulations
IEEE GLOBECOM 1998 (Cat. NO. 98CH36250), 2002Previous work by the authors presents a novel class of signal space codes called collision resistant modulations (CRM) for bandwidth efficient transmission on a random access collision channel, as in packet-radio applications. Results show that CRMs achieve a significant gain over traditional modulation formats under a slotted ALOHA protocol.
LEONARDI, Emilio, CAIRE G., VITERBO E.
openaire +2 more sources