Sciweavers

196 search results - page 9 / 40
» Canonizable Partial Order Generators
Sort
View
JOC
2002
99views more  JOC 2002»
13 years 8 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
DAM
2011
13 years 3 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
ISCAS
2008
IEEE
112views Hardware» more  ISCAS 2008»
14 years 3 months ago
Power optimization of weighted bit-product summation tree for elementary function generator
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...
Saeeid Tahmasbi Oskuii, Kenny Johansson, Oscar Gus...
PEPM
1992
ACM
14 years 21 days ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
FQAS
1998
Springer
118views Database» more  FQAS 1998»
14 years 26 days ago
Partial Answers for Unavailable Data Sources
Abstract. Many heterogeneous database system products and prototypes exist today; they will soon be deployed in a wide variety of environments. Most existing systems suffer from an...
Philippe Bonnet, Anthony Tomasic