On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit A New Construction
- 12 July 2002
- book chapter
- Published by Springer Nature
- p. 237-251
- https://doi.org/10.1007/3-540-45661-9_19
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Security of Cipher Block ChainingPublished by Springer Nature ,2001
- L-collision Attacks against Randomized MACsPublished by Springer Nature ,2000
- CBC MACs for Arbitrary-Length Messages: The Three-Key ConstructionsPublished by Springer Nature ,2000
- Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday BarrierPublished by Springer Nature ,1999
- UMAC: Fast and Secure Message AuthenticationPublished by Springer Nature ,1999
- Building PRFs from PRPsPublished by Springer Nature ,1998
- Luby-Rackoff backwards: Increasing security by making block ciphers non-invertiblePublished by Springer Nature ,1998
- XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom FunctionsPublished by Springer Nature ,1995
- Fast Software EncryptionPublished by Springer Nature ,1995
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981