Sciweavers

115 search results - page 16 / 23
» AFTA: A Formal Delay Model for Functional Timing Analysis
Sort
View
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 2 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
ACNS
2007
Springer
129views Cryptology» more  ACNS 2007»
14 years 2 months ago
Gradually Convertible Undeniable Signatures
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
Laila El Aimani, Damien Vergnaud
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 3 days ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ICSOC
2010
Springer
13 years 6 months ago
A Requirement-Centric Approach to Web Service Modeling, Discovery, and Selection
Service-Oriented Computing (SOC) has gained considerable popularity for implementing Service-Based Applications (SBAs) in a flexible and effective manner. The basic idea of SOC i...
Maha Driss, Naouel Moha, Yassine Jamoussi, Jean-Ma...
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir