Side Channel Attack Resistance of the Elliptic Curve Point Multiplication using Gaussian Integers
- Elliptic curve cryptography is a cornerstone of embedded security. However, hardware implementations of the elliptic curve point multiplication are prone to side channel attacks. In this work, we present a new key expansion algorithm which improves the resistance against timing and simple power analysis attacks. Furthermore, we consider a new concept for calculating the point multiplication, where the points of the curve are represented as Gaussian integers. Gaussian integers are subset of the complex numbers, such that the real and imaginary parts are integers. Since Gaussian integer fields are isomorphic to prime fields, this concept is suitable for many elliptic curves. Representing the key by a Gaussian integer expansion is beneficial to reduce the computational complexity and the memory requirements of a secure hardware implementation.
| Author: | Malek Safieh, Johann-Philipp ThiersORCiD, Jürgen FreudenbergerORCiDGND |
|---|---|
| DOI: | https://doi.org/10.1109/ZINC50678.2020.9161769 |
| ISBN: | 978-1-7281-8259-9 |
| Parent Title (English): | ZINC 2020, Zooming Innovation in Consumer Technologies Conference, 26-27 May, 2020, Novi Sad, Serbia |
| Publisher: | IEEE |
| Document Type: | Conference Proceeding |
| Language: | English |
| Year of Publication: | 2020 |
| Release Date: | 2021/01/04 |
| Tag: | Gaussian processes; Public key cryptography |
| First Page: | 231 |
| Last Page: | 236 |
| Note: | Volltextzugriff für Angehörige der Hochschule Konstanz via Datenbank IEEE Xplore möglich |
| Institutes: | Institut für Systemdynamik - ISD |
| DDC functional group: | 000 Allgemeines, Informatik, Informationswissenschaft |
| Open Access?: | Nein |
| Licence (German): |  Urheberrechtlich geschützt |
