Elliptic Curve Cryptography on a Palm OS Device
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
PGP in constrained wireless devices
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
High-speed hardware implementations of Elliptic Curve Cryptography: A survey
Journal of Systems Architecture: the EUROMICRO Journal
An efficient polynomial multiplier in GF(2m) and its application to ECC designs
Proceedings of the conference on Design, automation and test in Europe
Flexible hardware reduction for elliptic curve cryptography in GF(2m)
Proceedings of the conference on Design, automation and test in Europe
Public key cryptography empowered smart dust is affordable
International Journal of Sensor Networks
An encryption-enabled network protocol accelerator
WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications
SoC: a real platform for IP reuse, IP infringement, and IP protection
VLSI Design - Special issue on CAD for Gigascale SoC Design and Verification Solutions
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
| Hi-index | 0.00 |
Securing communication channels is especially needed in wireless environments. But applying cipher mechanisms in software is limited by the calculation and energy resources of the mobile devices. If hardware is applied to realize cryptographic operations cost becomes an issue. In this paper we describe an approach which tackles all these three points. We implemented a hardware accelerator for polynomial multiplication in extended Galois fields (GF) applying Karatsuba's method iteratively. With this approach the area consumption is reduced to 2.1 mm^2 in comparison to. 6.2 mm^2 for the standard application of Karatsuba's method i.e. for recursive application. Our approach also reduces the energy consumption to 60 per cent of the original approach. The price we have to pay for these achievement is the increased execution time. In our implementation a polynomial multiplication takes 3 clock cycles whereas the recurisve Karatsuba approach needs only one clock cycle. But considering area, energy and calculation speed we are convinced that the benefits of our approach outweigh its drawback.