Sciweavers

6 search results - page 1 / 2
» Low-Complexity Compression of Short Messages
Sort
View
DCC
2006
IEEE
14 years 4 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
13 years 8 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
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...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
AHS
2006
IEEE
124views Hardware» more  AHS 2006»
13 years 11 months ago
A Generic On-Chip Debugger for Wireless Sensor Networks
— This invited paper overviews the low level debug support hardware required for an on-chip predeployment debugging system for sensor networks. The solution provides significant...
Andrew B. T. Hopkins, Klaus D. McDonald-Maier
ACISP
2007
Springer
13 years 11 months ago
Non-interactive Manual Channel Message Authentication Based on eTCR Hash Functions
We present a new non-interactive message authentication protocol in manual channel model (NIMAP, for short) using the weakest assumption on the manual channel (i.e. assuming the st...
Mohammad Reza Reyhanitabar, Shuhong Wang, Reihaneh...
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
12 years 8 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir