Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

IJNSEC
2006

favoriteEmaildiscussreport

81views more IJNSEC 2006»

Small Size Hashes with Enhanced Security

13 years 4 months ago

Small Size Hashes with Enhanced Security

Download ijns.femto.com.tw

This paper contains techniques for enhancing the strength of any cryptographic hash function. For an "ideal", traditional hash function with an m-bit result, the complexity of a collision attack is approximately 2m/2 . Here constructions are presented where collisions are harder to find.

Lars R. Knudsen

Real-time Traffic

Cryptographic Hash Function | Hash Function | IJNSEC 2006 | Traditional Hash Function |

claim paper

Related Content

» More Robust Hashing Cuckoo Hashing with a Stash

» A Key Distribution method for Reducing Storage and Supporting High Level Security in the L...

» Enhanced Cost Effective Symmetric Key Algorithm for Small Amount of Data

» Fast Message Authentication Using Efficient Polynomial Evaluation

» The PHOTON Family of Lightweight Hash Functions

» Robust perceptual image hashing via matrix invariants

» How to Compress Rabin Ciphertexts and Signatures and More

» Encryption Schemes Secure against ChosenCiphertext Selective Opening Attacks

» BoundedConcurrent Secure TwoParty Computation in a Constant Number of Rounds

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	IJNSEC
Authors	Lars R. Knudsen

Comments (0)