27 search results - page 1 / 6 » Montgomery Exponentiation with no Final Subtractions: Improv... |
CHES
2000
Springer
13 years 9 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...
JUCS
2010
13 years 3 months ago
2010
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
ICC
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
FOCS
1998
IEEE
13 years 8 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
IIS
2003
13 years 6 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...