Back to Results
First PageMeta Content
Hashing / Search algorithms / Hash function / Preimage attack / SHA-1 / Collision attack / HMAC / SHA-2 / Merkle–Damgård construction / Cryptographic hash functions / Cryptography / Error detection and correction


Generic collision attacks on narrow-pipe hash functions faster than birthday paradox, applicable to MDx, SHA-1, SHA-2, and SHA-3 narrow-pipe candidates Vlastimil Klima1 and Danilo Gligoroski2 1
Add to Reading List

Document Date: 2010-08-04 14:03:01

Open Document

File Size: 104,24 KB

Share Result on Facebook

City

Santa Barbara / Prague / /

Company

KNZ s.r.o. / /

Country

United States / Czech Republic / /

/

Facility

Institute of Telematics / Norwegian University of Science / Stanford University / /

IndustryTerm

collision search / public key systems / /

Organization

Faculty of Information Technology / Mathematics and Electrical Engineering / Institute of Telematics / Stanford University / Norwegian University of Science and Technology / /

Person

D. Gligoroski / V / /

Position

Consultant / /

ProvinceOrState

California / /

PublishedMedium

Lecture Notes in Computer Science / /

SportsLeague

Stanford University / /

Technology

RAM / public key / Information Technology / /

URL

http /

SocialTag