Low-power modular reduction in GF (2m) for sensor networks

Jakub Piotr Olszyna , Wiesław Winiecki , Tomasz Adamski

Abstract

The paper deals with modular reduction algorithms well suited to sensor networks. Specific properties of sensor networks (low power and computing resources at the sensor side) require careful choice of cryptographic algorithms and optimization of their implementations. Unlike most research involving modular multiplication/reduction this work targets low-power solutions through application of various power reduction techniques.
Author Jakub Piotr Olszyna RE
Jakub Piotr Olszyna,,
- The Institute of Radioelectronics
, Wiesław Winiecki RE
Wiesław Winiecki,,
- The Institute of Radioelectronics
, Tomasz Adamski ISE
Tomasz Adamski,,
- The Institute of Electronic Systems
Pages351-355
Book 2011 IEEE 6th International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS), vol. 1, 2011, ISBN 978-1-4577-1423-8
Keywords in Englishcryptographic algorithms, cryptography, modular reduction algorithms, power reduction techniques, sensor networks, wireless sensor networks
DOIDOI:10.1109/IDAACS.2011.6072772
Languageen angielski
Score (nominal)10
Citation count*5 (2018-07-12)
Cite
Share Share

Get link to the record
msginfo.png


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back