1449 search results - page 25 / 290 » Self-Randomized Exponentiation Algorithms |
ARITH
1999
IEEE
15 years 4 months ago
1999
IEEE
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
172
Voted
POPL
2001
ACM
16 years 23 days ago
2001
ACM
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
87
Voted
CHES
2000
Springer
15 years 4 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
84
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
STOC
2002
ACM
16 years 23 days ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...