Sciweavers

1449 search results - page 94 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
JMLR
2010
137views more  JMLR 2010»
15 years 1 months ago
Importance Sampling for Continuous Time Bayesian Networks
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Yu Fan, Jing Xu, Christian R. Shelton
CHES
2004
Springer
187views Cryptology» more  CHES 2004»
15 years 11 months ago
A New Attack with Side Channel Leakage During Exponent Recoding Computations
In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and c...
Yasuyuki Sakai, Kouichi Sakurai
DCC
2002
IEEE
16 years 5 months ago
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(qm ). Unlike the original algorithm, the method introd...
Jorge Guajardo, Christof Paar
CP
2005
Springer
15 years 11 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen