Sciweavers

Share
FSE
2004
Springer
130views Cryptology» more  FSE 2004»
10 years 1 months ago
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan
A cryptanalysis is given of a MAC proposal presented at CRYPTO 2003 by Cary and Venkatesan. A nice feature of the CaryVenkatesan MAC is that a lower bound on its security can be pr...
Simon R. Blackburn, Kenneth G. Paterson
FSE
2004
Springer
115views Cryptology» more  FSE 2004»
10 years 1 months ago
Correlation Attacks Using a New Class of Weak Feedback Polynomials
In 1985 Siegenthaler introduced the concept of correlation attacks on LFSR based stream ciphers. A few years later Meier and Staffelbach demonstrated a special technique, usually ...
Håkan Englund, Martin Hell, Thomas Johansson
FSE
2004
Springer
101views Cryptology» more  FSE 2004»
10 years 1 months ago
The EAX Mode of Operation
Mihir Bellare, Phillip Rogaway, David Wagner
FSE
2004
Springer
94views Cryptology» more  FSE 2004»
10 years 1 months ago
Improving Fast Algebraic Attacks
Frederik Armknecht
FSE
2004
Springer
90views Cryptology» more  FSE 2004»
10 years 1 months ago
Fast Software-Based Attacks on SecurID
SecurID is a widely used hardware token for strengthening authentication in a corporate environment. Recently, Biryukov, Lano, and Preneel presented an attack on the alleged SecurI...
Scott Contini, Yiqun Lisa Yin
FSE
2004
Springer
84views Cryptology» more  FSE 2004»
10 years 1 months ago
Vulnerability of Nonlinear Filter Generators Based on Linear Finite State Machines
We present a realization of an LFSM that utilizes an LFSR. This is based on a well-known fact from linear algebra. This structure is used to show that a previous attempt at using a...
Jin Hong, Dong Hoon Lee 0002, Seongtaek Chee, Pala...
EUROCRYPT
2004
Springer
10 years 1 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
EUROCRYPT
2004
Springer
10 years 1 months ago
Optimal Communication Complexity of Generic Multicast Key Distribution
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
Daniele Micciancio, Saurabh Panjwani
EUROCRYPT
2004
Springer
10 years 1 months ago
Algebraic Attacks and Decomposition of Boolean Functions
Willi Meier, Enes Pasalic, Claude Carlet
books