Optimizing memory cost of multi-scalar multiplication

DOI10.4213/MVK183MaRDI QIDQ3381822zbMATH OpenOpenAlexFDO

Authors S. V. Grebnev

Publication date 20 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk183

zbMATH Keywords

digital signaturemulti-scalar multiplicationnon-adjacent formperformance evaluation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Multibase scalar multiplications in cryptographic pairings
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• Extending Scalar Multiplication Using Double Bases
• Double-Base Number System for Multi-scalar Multiplications
• Fast simultaneous scalar multiplication

Cites work

• Double-Base Number System for Multi-scalar Multiplications
• Efficient implementation of the GOST R 34.10 digital signature scheme using modern approaches to elliptic curve scalar multiplication
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields

Cited in

(1)

• An experimental study of improving performance by scalar replacement

Describes a project that uses

Uses Software

• EFD

This page was built for publication: Optimizing memory cost of multi-scalar multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3381822)