Speeding-Up Elliptic Curve Cryptography Algorithms

Diana Maimut; Alexandru Cristian Matei

Paper 2022/1458

Speeding-Up Elliptic Curve Cryptography Algorithms

Diana Maimut

, Advanced Technologies Institute

Alexandru Cristian Matei

, Advanced Technologies Institute

Abstract

During the last decades there has been an increasing interest in Elliptic curve cryptography (ECC) and, especially, the Elliptic Curve Digital Signature Algorithm (ECDSA) in practice. The rather recent developments of emergent technologies, such as blockchain and the Internet of Things (IoT), have motivated researchers and developers to construct new cryptographic hardware accelerators for ECDSA. Different types of optimizations (either platform dependent or algorithmic) were presented in the literature. In this context, we turn our attention to ECC and propose a new method for generating ECDSA moduli with a predetermined portion that allows one to double the speed of Barrett's algorithm. Moreover, we take advantage of the advancements in the Artificial Intelligence (AI) field and bring forward an AI-based approach that enhances Schoof's algorithm for finding the number of points on an elliptic curve in terms of implementation efficiency. Our results represent algorithmic speed-ups exceeding the current paradigm as we are also preoccupied by other particular security environments meeting the needs of governmental organizations.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Mathematics MDPI
DOI: 10.3390/math10193676
Keywords: Elliptic curve elliptic curve cryptography ECDSA artificial intelligence Schoof's algorithm Barrett's algorithm
Contact author(s): maimut diana @ gmail com
alexandru matei @ dcti ro
History: 2022-12-05: revised; 2022-10-25: received; See all versions
Short URL: https://ia.cr/2022/1458
License: CC BY-SA

BibTeX

@misc{cryptoeprint:2022/1458,
      author = {Diana Maimut and Alexandru Cristian Matei},
      title = {Speeding-Up Elliptic Curve Cryptography Algorithms},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/1458},
      year = {2022},
      doi = {10.3390/math10193676},
      url = {https://eprint.iacr.org/2022/1458}
}