Sciweavers

66 search results - page 6 / 14
» Universal Hashing and Authentication Codes
Sort
View
CARDIS
1998
Springer
110views Hardware» more  CARDIS 1998»
13 years 12 months ago
Reducing the Collision Probability of Alleged Comp128
Wagner, Goldberg and Briceno have recently published an attack [2] on what they believe to be Comp128, the GSM A3A8 authentication hash function [1]. Provided that the attacker has...
Helena Handschuh, Pascal Paillier
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
14 years 1 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak
ASIACRYPT
2007
Springer
13 years 11 months ago
On Efficient Message Authentication Via Block Cipher Design Techniques
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
Goce Jakimoski, K. P. Subbalakshmi
ICISC
2007
152views Cryptology» more  ICISC 2007»
13 years 9 months ago
Analysis of Multivariate Hash Functions
We analyse the security of new hash functions whose compression function is explicitly defined as a sequence of multivariate equations. First we prove non-universality of certain ...
Jean-Philippe Aumasson, Willi Meier
CRYPTO
1999
Springer
159views Cryptology» more  CRYPTO 1999»
13 years 12 months ago
UMAC: Fast and Secure Message Authentication
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
John Black, Shai Halevi, Hugo Krawczyk, Ted Krovet...