18 search results - page 1 / 4 » Fast Message Authentication Using Efficient Polynomial Evalu... |
FSE
1997
Springer
14 years 3 days ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
FSE
2007
Springer
14 years 2 months ago
2007
Springer
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...
HPCA
1998
IEEE
14 years 24 days ago
1998
IEEE
We propose and evaluate two complementary techniques to protect and virtualize a tightly-coupled network interface in a multicomputer. The techniques allow efficient, direct appli...
TC
2008
13 years 8 months ago
2008
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...