Sciweavers

658 search results - page 83 / 132
» The Grindahl Hash Functions
Sort
View
PKC
2010
Springer
150views Cryptology» more  PKC 2010»
15 years 1 months ago
Security of Encryption Schemes in Weakened Random Oracle Models
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
Akinori Kawachi, Akira Numayama, Keisuke Tanaka, K...
AHS
2007
IEEE
210views Hardware» more  AHS 2007»
15 years 4 months ago
MOVES: A Modular Framework for Hardware Evolution
In this paper, we present a framework that supports experimenting with evolutionary hardware design. We describe the framework’s modules for composing evolutionary optimizers an...
Paul Kaufmann, Marco Platzner
CPE
1998
Springer
80views Hardware» more  CPE 1998»
15 years 2 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
CN
2007
97views more  CN 2007»
14 years 9 months ago
Security enhancement of an IC-card-based remote login mechanism
Wang et al. presented a remote password authentication scheme using IC (Integrated Circuit) cards in 2004. Unfortunately, we discovered that their scheme is unable to withstand th...
Ting-Fang Cheng, Jung-San Lee, Chin-Chen Chang
TIT
2008
106views more  TIT 2008»
14 years 9 months ago
Byzantine Modification Detection in Multicast Networks With Random Network Coding
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M&eacut...