Memory-Efficient Algorithm for Scalar Multiplications on Twisted Edwards Curves for Isogeny-Based Cryptosystems

Sookyung Eom, Hyang-Sook Lee, Kyunghwan Song and Salvatore Alfonzetti

Mathematical Problems in Engineering, 2022, vol. 2022, 1-8

Abstract: Scalar multiplications are considered an essential aspect of implementations of isogeny-based cryptography. The efficiency of scalar multiplication depends on the equation of the underlying elliptic curves and the addition chain employed. Bos and Friedberger recently stated that, for larger scalar multiplication, addition-subtraction chains will become more useful for twisted Edwards curves because of the differential restriction on Montgomery curves in the setting of isogeny-based cryptosystem. Motivated by these comments, we attempt to increase the efficiency of scalar multiplication in twisted Edwards curves in terms of the memory of algorithms. In this paper, we present a double-base addition-subtraction chain algorithm with memory efficiency for scalar multiplication. The memory usage of this part is Ologn2/loglogn, which is better than the result of the tree-based approach, which is Ologn2.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/3846369.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/3846369.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3846369

DOI: 10.1155/2022/3846369

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().