Sciweavers

18 search results - page 3 / 4
» Speeding Up Secure Computations via Embedded Caching.
Sort
View
AFRICACRYPT
2010
Springer
14 years 1 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
ICISC
2009
132views Cryptology» more  ICISC 2009»
13 years 4 months ago
Side-Channel Analysis of Cryptographic Software via Early-Terminating Multiplications
Abstract. The design of embedded processors demands a careful tradeoff between many conflicting objectives such as performance, silicon area and power consumption. Finding such a t...
Johann Großschädl, Elisabeth Oswald, Da...
ICCS
2009
Springer
14 years 24 days ago
Fast Conjugate Gradients with Multiple GPUs
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...
Ali Cevahir, Akira Nukada, Satoshi Matsuoka
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
13 years 11 months ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
RTCSA
2000
IEEE
13 years 10 months ago
Frame packing in real-time communication
A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and...
Kristian Sandström, Christer Norström, M...