|
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.
Received 01.III.2015
Citation:
S. V. Grebnev, “Optimizing memory cost of multi-scalar multiplication”, Mat. Vopr. Kriptogr., 7:2 (2016), 53–60
Linking options:
https://www.mathnet.ru/eng/mvk183https://doi.org/10.4213/mvk183 https://www.mathnet.ru/eng/mvk/v7/i2/p53
|
Statistics & downloads: |
Abstract page: | 288 | Full-text PDF : | 204 | References: | 39 | First page: | 1 |
|