Sciweavers

7924 search results - page 356 / 1585
» Non-Malleable Functions and Their Applications
Sort
View
CORR
2010
Springer
62views Education» more  CORR 2010»
15 years 7 months ago
Guessing Revisited: A Large Deviations Approach
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...
Manjesh Kumar Hanawal, Rajesh Sundaresan
IPPS
2006
IEEE
16 years 1 months ago
Exploiting processing locality through paging configurations in multitasked reconfigurable systems
FPGA chips in reconfigurable computer systems are used as malleable coprocessors where components of a hardware library of functions can be configured as needed. As the number of ...
T. Taher, Tarek A. El-Ghazawi
189
Voted
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
15 years 11 months ago
Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
A series of recent papers have demonstrated collision attacks on popularly used hash functions, including the widely deployed MD5 and SHA-1 algorithm. To assess this threat, the na...
Michael Szydlo, Yiqun Lisa Yin
219
Voted
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
15 years 11 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
231
Voted
CRYPTO
1997
Springer
156views Cryptology» more  CRYPTO 1997»
15 years 11 months ago
Fast and Secure Hashing Based on Codes
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
Lars R. Knudsen, Bart Preneel