RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2016 Volume 7, Issue 2, Pages 53–60 (Mi mvk183)

Optimizing memory cost of multi-scalar multiplication

S. V. Grebnev

National Research University Higher School of Economics, Moscow

Abstract: We present a modification of the non-adjacent form representation for multi-scalar multiplication which allows efficient performance-memory tradeoffs. Simultaneously we fix a feature of the original algorithm which prevented it from using all possible bases.

Key words: multi-scalar multiplication, non-adjacent form, digital signature, performance evaluation.

UDC: 519.719

Received 01.III.2015

Language: English

DOI: 10.4213/mvk183



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024