Sciweavers

67 search results - page 7 / 14
» Montgomery Modular Multiplication Algorithm on Multi-Core Sy...
Sort
View
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
14 years 1 months ago
Predicting Secret Keys Via Branch Prediction
This paper announces a new software side-channel attack — enabled by the branch prediction capability common to all modern highperformance CPUs. The penalty paid (extra clock cyc...
Onur Aciiçmez, Çetin Kaya Koç...
ISCAS
2008
IEEE
154views Hardware» more  ISCAS 2008»
14 years 1 months ago
A 6.3nJ/op low energy 160-bit modulo-multiplier for elliptic curve cryptography processor
— A low energy modulo-multiplier is proposed for elliptic curve cryptography (ECC) processor, especially for authentication in mobile device or key encryption in embedded health-...
Hyejung Kim, Yongsang Kim, Hoi-Jun Yoo
COMSWARE
2007
IEEE
14 years 1 months ago
A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks
The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further pa...
Sarang Aravamuthan, Viswanatha Rao Thumparthy
AROBOTS
2000
104views more  AROBOTS 2000»
13 years 7 months ago
Heterogeneous Teams of Modular Robots for Mapping and Exploration
In this article, we present the design of a team of heterogeneous, centimeter-scale robots that collaborate to map and explore unknown environments. The robots, called Millibots, a...
Robert Grabowski, Luis E. Navarro-Serment, Christi...
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 2 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi