Jürgen Freudenberger

Montgomery Modular Arithmetic over Gaussian Integers

2020

The Montgomery multiplication is an efficient method for modular arithmetic. Typically, it is used for modular arithmetic over integer rings to prevent the expensive inversion for the modulo reduction. In this work, we consider modular …

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

2020

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 …