Sciweavers

1631 search results - page 185 / 327
» Observing Functional Logic Computations
Sort
View
151
Voted
CSFW
2012
IEEE
13 years 6 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
220
Voted
FCCM
2003
IEEE
113views VLSI» more  FCCM 2003»
15 years 9 months ago
Issues and Approaches to Coarse-Grain Reconfigurable Architecture Development
Although domain-specialized FPGAs can offer significant area, speed and power improvements over conventional reconfigurable devices, there are several unique and unexplored design...
Kenneth Eguro, Scott Hauck
162
Voted
CASES
2010
ACM
15 years 1 months ago
Improving the quality of ring oscillator PUFs on FPGAs
Physical Unclonable Functions (PUFs) based on Ring Oscillators (ROs) are a promising primitive for FPGA security. However, the quality of their implementation depends on several d...
Dominik Merli, Frederic Stumpf, Claudia Eckert
124
Voted
ICAI
2007
15 years 5 months ago
Mining and Dynamic Simulation of Sub-Networks from Large Biomolecular Networks
Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular...
Xiaohua Hu, Fang-Xiang Wu, Michael K. Ng, Bahrad A...
144
Voted
DAC
2006
ACM
16 years 4 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu