Volltext-Downloads (blau) und Frontdoor-Views (grau)
The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 20 of 103
Back to Result List

Side Channel Attack Resistance of the Elliptic Curve Point Multiplication using Eisenstein Integers

  • Asymmetric cryptography empowers secure key exchange and digital signatures for message authentication. Nevertheless, consumer electronics and embedded systems often rely on symmetric cryptosystems because asymmetric cryptosystems are computationally intensive. Besides, implementations of cryptosystems are prone to side-channel attacks (SCA). Consequently, the secure and efficient implementation of asymmetric cryptography on resource-constrained systems is demanding. In this work, elliptic curve cryptography is considered. A new concept for an SCA resistant calculation of the elliptic curve point multiplication over Eisenstein integers is presented and an efficient arithmetic over Eisenstein integers is proposed. Representing the key by Eisenstein integer expansions is beneficial to reduce the computational complexity and the memory requirements of an SCA protected implementation.

Export metadata

Additional Services

Search Google Scholar

Statistics

frontdoor_oas
Metadaten
Author:Johann-Philipp ThiersORCiD, Malek Safieh, Jürgen FreudenbergerORCiDGND
URL:https://edas.info/p27511
Parent Title (English):ICCE Berlin 2020, 10th IEEE International Conference on Consumer Electronics, 9.-12.11.2020, virtual
Publisher:IEEE
Document Type:Conference Proceeding
Language:English
Year of Publication:2020
Release Date:2021/01/18
Page Number:6
Institutes:Institut für Systemdynamik - ISD
Open Access?:Ja
Relevance:Keine peer reviewed Publikation (Wissenschaftlicher Artikel und Aufsatz, Proceeding, Artikel in Tagungsband)