EC-ECC: Accelerating Elliptic Curve Cryptography for Edge Computing on Embedded GPU TX2

Abstract

Driven by artificial intelligence and computer vision industries, Graphics Processing Units (GPUs) are now rapidly achieving extraordinary computing power. In particular, the NVIDIA Tegra K1/X1/X2 embedded GPU platforms, which are also treated as edge computing devices, are now widely used in embedded environments such as mobile phones, game consoles, and vehicle-mounted systems to support high-dimension display, auto-pilot, and so on. Meanwhile, with the rise of the Internet of Things (IoT), the demand for cryptographic operations for secure communications and authentications between edge computing nodes and IoT devices is also expanding. In this contribution, instead of the conventional implementations based on FPGA, ASIC, and ARM CPUs, we provide an alternative solution for cryptographic implementation on embedded GPU devices. Targeting the new cipher suite added in TLS 1.3, we implement Edwards25519/448 and Curve25519/448 on an edge computing platform, embedded GPU NVIDIA Tegra X2, where various performance optimizations are customized for the target platform, including a novel parallel method for the register-limited embedded GPUs. With about 15 W of power consumption, it can provide 210k/31k ops/s of Curve25519/448 scalar multiplication, 834k/123k ops/s of fixed-point Edwards25519/448 scalar multiplication, and 150k/22k ops/s of unknown-point one, which are respectively the primitives and main workloads of key agreement, signature generation, and verification of the TLS 1.3 protocol. Our implementations achieve 8 to 26 times speedup of OpenSSL running in the very powerful ARM CPU of the same platform and outperform the state-of-the-art implementations in FPGA by a wide margin with better power efficiency.

Armed with Faster Crypto: Optimizing Elliptic Curve Cryptography for ARM Processors

“…Our approach, in contrast, relies on integer arithmetic. Meanwhile, Dong et al [16] achieved performance gains through an alternative avenue: harnessing embedded graphical processing units (GPUs).…”

“…The multiple of the field order is taken to avoid an underflow as −x ≡ k • p − x mod p for any integer k with field order p. In certain algorithms when we know the bounds are low, we can perform a lazy negation with 2 • p and without a reduction, ensuring that the bound stays low. Otherwise, if the bounds are high, we can perform a reduction with 16 • p and perform a reduction afterwards. This still requires knowing the bounds beforehand, as we cannot exceed the field size.…”

Image sharing based on 3D-BCNN and Blockchain Authentication

“…In 1985, mathematician Victor Miller proposed elliptic curves in cryptography and assumed that exponential calculus methods were highly unlikely to work with elliptic curves [37]. Subsequently, elliptic curve cryptography (ECC) is introduced as an asymmetric encryption method in key negotiation, digital signature and bitcoin (BTC) [38,39]. Compared with traditional RSA, ECC can generated a tiny key through discrete logarithm.…”

Parallel Implementation of Lightweight Secure Hash Algorithm on CPU and GPU Environments

“…In the case of NIST PQC optimization research using GPU, various approaches were proposed, including a PQC internal function parallel method and a PQC internal function acceleration method using GPU Tensor Core [24][25][26][27][28][29][30]. In addition, research on ECC using GPU architecture is continuously being conducted [31][32][33]. Research on block cipher algorithms and hash functions in GPU architectures has also been published [34][35][36][37][38][39][40][41].…”