Sciweavers

277 search results - page 14 / 56
» The Whirlpool Secure Hash Function
Sort
View
101
Voted
FSE
2004
Springer
90views Cryptology» more  FSE 2004»
15 years 9 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
136
Voted
FSE
2006
Springer
117views Cryptology» more  FSE 2006»
15 years 7 months ago
How Far Can We Go on the x64 Processors?
This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on the new 64-bit x64 processors, AMD Athlon64 (AMD64) and Intel Pe...
Mitsuru Matsui
131
Voted
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
15 years 9 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye
132
Voted
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
15 years 10 months ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
106
Voted
CRYPTO
2004
Springer
108views Cryptology» more  CRYPTO 2004»
15 years 9 months ago
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Many cryptographic primitives begin with parameter generation, which picks a primitive from a family. Such generation can use public coins (e.g., in the discrete-logarithm-based c...
Chun-Yuan Hsiao, Leonid Reyzin