Sciweavers

1449 search results - page 271 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
15 years 11 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
111
Voted
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
15 years 8 months ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch
FOCS
2003
IEEE
15 years 7 months ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra
BIRTHDAY
2010
Springer
15 years 7 months ago
Indexing and Searching a Mass Spectrometry Database
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
Søren Besenbacher, Benno Schwikowski, Jens ...
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
15 years 7 months ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...