Practical collisions for EnRUPT
From MaRDI portal
Publication:2429710
DOI10.1007/s00145-010-9058-xzbMath1209.68221OpenAlexW2094445407MaRDI QIDQ2429710
Sebastiaan Indesteege, Bart Preneel
Publication date: 1 April 2011
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1950/
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Meet-in-the-Middle Attacks on SHA-3 Candidates
- Practical Collisions for EnRUPT
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- How to Break MD5 and Other Hash Functions
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Topics in Cryptology – CT-RSA 2005
- Cryptography and Coding
This page was built for publication: Practical collisions for EnRUPT