Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form

DOI10.1080/09720529.2015.1023538OpenAlexW2286039514MaRDI QIDQ5069746

Mohamad Rushdan Said M.D., Najlae Falah Hameed al Saffar

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2015.1023538

zbMATH Keywords

elliptic curve cryptosystemelliptic curve scalar multiplicationnon adjacent form

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07) Circuits in qualitative investigation and simulation of models (94C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for the length of addition chains
• Elliptic curve cryptosystems and their implementation
• Signed bits and fast exponentiation
• On binary signed digit representations of integers
• On a generalization of addition chains: addition-multiplication chains
• Optimal left-to-right binary signed-digit recoding
• Minimum weight modified signed-digit representations and fast exponentiation
• A Public Key Cryptosystem Based upon Euclidean Addition Chains
• Elliptic Curve Cryptosystems
• A method for obtaining digital signatures and public-key cryptosystems
• A Survey of Fast Exponentiation Methods
• Efficient Generation of Minimal Length Addition Chains
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• On Generalized Addition Chains
• Progress in Cryptology - INDOCRYPT 2004
• Minimality and other properties of the width-𝑤 nonadjacent form
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form