Sciweavers

2634 search results - page 32 / 527
» Faster Than Uppaal
Sort
View
ASPLOS
1996
ACM
13 years 11 months ago
The Rio File Cache: Surviving Operating System Crashes
: One of the fundamental limits to high-performance, high-reliability file systems is memory's vulnerability to system crashes. Because memory is viewed as unsafe, systems per...
Peter M. Chen, Wee Teck Ng, Subhachandra Chandra, ...
DAC
1996
ACM
13 years 11 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
CRYPTO
1992
Springer
138views Cryptology» more  CRYPTO 1992»
13 years 11 months ago
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cr...
Daniel M. Gordon
ASPDAC
2000
ACM
133views Hardware» more  ASPDAC 2000»
13 years 11 months ago
A VLSI implementation of the blowfish encryption/decryption algorithm
We propose an efficient hardware architecture for the Blowfish algorithm [1]. The speed is up to 4 bit/clock, which is 9 times faster than a Pentium. By applying operator-reschedul...
Michael C.-J. Lin, Youn-Long Lin
FCCM
1997
IEEE
106views VLSI» more  FCCM 1997»
13 years 11 months ago
Fault simulation on reconfigurable hardware
In this paper we introduce a new approach to fault simulation, using reconfigurable hardware to implement a critical path tracing algorithm. Our performance estimate shows that ou...
Miron Abramovici, Premachandran R. Menon