2767 search results - page 12 / 554 » Universal Exponentiation Algorithm |
SODA
2003
ACM
13 years 11 months ago
2003
ACM
SACRYPT
2001
Springer
14 years 2 months ago
2001
Springer
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
CHES
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Three new types of power analysis attacks against smartcard implementations of modular exponentiation algorithms are described. The first attack requires an adversary to ...
STOC
2012
ACM
12 years 12 days ago
2012
ACM
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
NECO
2008
13 years 10 months ago
2008
In this paper we show that exponentially deep belief networks [3, 7, 4] can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each lay...