Multilane HMAC— Security beyond the Birthday Limit
- 30 November 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- New Proofs for NMAC and HMAC: Security Without Collision-ResistanceLecture Notes in Computer Science, 2006
- Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash CollisionsLecture Notes in Computer Science, 2006
- On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract)Lecture Notes in Computer Science, 2006
- How to Maximize Software Performance of Symmetric Primitives on Pentium III and 4 ProcessorsLecture Notes in Computer Science, 2005
- A Failure-Friendly Design Principle for Hash FunctionsLecture Notes in Computer Science, 2005
- On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit A New ConstructionPublished by Springer Science and Business Media LLC ,2002
- New (Two-Track-)MAC Based on the Two Trails of RIPEMDLecture Notes in Computer Science, 2001
- Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday BarrierPublished by Springer Science and Business Media LLC ,1999
- Foiling Birthday Attacks in Length-Doubling TransformationsLecture Notes in Computer Science, 1996
- XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom FunctionsLecture Notes in Computer Science, 1995