Sciweavers

1834 search results - page 197 / 367
» Public Key Cryptography
Sort
View
FSE
2007
Springer
107views Cryptology» more  FSE 2007»
14 years 3 months ago
Message Freedom in MD4 and MD5 Collisions: Application to APOP
Abstract. In Wang’s attack, message modifications allow to deterministically satisfy certain sufficient conditions to find collisions efficiently. Unfortunately, message modi...
Gaëtan Leurent
FSE
2007
Springer
104views Cryptology» more  FSE 2007»
14 years 3 months ago
How to Enrich the Message Space of a Cipher
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
Thomas Ristenpart, Phillip Rogaway
PET
2007
Springer
14 years 3 months ago
Pairing-Based Onion Routing
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
SSC
2007
Springer
161views Cryptology» more  SSC 2007»
14 years 3 months ago
On Attacks on Filtering Generators Using Linear Subspace Structures
Abstract. The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines some bits from the shift register to create a ke...
Sondre Rønjom, Guang Gong, Tor Helleseth
AINA
2005
IEEE
14 years 2 months ago
Reducing Security Overhead for Mobile Networks
Security of mobile communications comes with the cost of computational overhead. Reducing the overhead in security computations is critical to ensure the overall performance of a ...
Fangguo Zhang, Yi Mu, Willy Susilo