Sciweavers

65 search results - page 11 / 13
» Trading Inversions for Multiplications in Elliptic Curve Cry...
Sort
View
CHES
2003
Springer
115views Cryptology» more  CHES 2003»
14 years 21 days ago
The Doubling Attack - Why Upwards Is Better than Downwards
The recent developments of side channel attacks have lead implementers to use more and more sophisticated countermeasures in critical operations such as modular exponentiation, or ...
Pierre-Alain Fouque, Frédéric Valett...
ISCAS
2006
IEEE
102views Hardware» more  ISCAS 2006»
14 years 1 months ago
A fast dual-field modular arithmetic logic unit and its hardware implementation
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
Kazuo Sakiyama, Bart Preneel, Ingrid Verbauwhede
WOWMOM
2005
ACM
165views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
Hybrid Key Establishment for Multiphase Self-Organized Sensor Networks
Recent work on key establishment for sensor networks has shown that it is feasible to employ limited Elliptic Curve Cryptography in sensor networks through hybrid protocols. In th...
Panayiotis Kotzanikolaou, Emmanouil Magkos, Christ...
COMCOM
2011
13 years 2 months ago
TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks
Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between ...
Leonardo B. Oliveira, Diego F. Aranha, Conrado Por...
ASAP
2004
IEEE
141views Hardware» more  ASAP 2004»
13 years 11 months ago
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
A. Murat Fiskiran, Ruby B. Lee