Speeding up the elliptic curve scalar multiplication using non adjacent form

DOI10.1080/09720529.2015.1023538MaRDI QIDQ5069746zbMATH OpenOpenAlexFDO

Authors Najlae Falah Hameed al Saffar, Mohamad Rushdan Md. Said

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

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

Recommendations

• Minimality and other properties of the width-𝑤 nonadjacent form
• Fast elliptic curve point multiplication based on window non-adjacent form method
• scientific article; zbMATH DE number 1618061
• Progress in Cryptology - INDOCRYPT 2004
• scientific article; zbMATH DE number 2219248

Cites work

• scientific article; zbMATH DE number 1618061 (Why is no real title available?)
• scientific article; zbMATH DE number 1722964 (Why is no real title available?)
• scientific article; zbMATH DE number 2085444 (Why is no real title available?)
• scientific article; zbMATH DE number 5968524 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1304119 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1962161 (Why is no real title available?)
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• A SIGNED BINARY MULTIPLICATION TECHNIQUE
• A Survey of Fast Exponentiation Methods
• A lower bound for the length of addition chains
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem based upon Euclidean addition chains
• Efficient Generation of Minimal Length Addition Chains
• Elliptic Curve Cryptosystems
• Elliptic curve cryptosystems and their implementation
• Minimality and other properties of the width-𝑤 nonadjacent form
• Minimum weight modified signed-digit representations and fast exponentiation
• On a generalization of addition chains: addition-multiplication chains
• On binary signed digit representations of integers
• On generalized addition chains
• Optimal left-to-right binary signed-digit recoding
• Progress in Cryptology - INDOCRYPT 2004
• Signed bits and fast exponentiation
• Speeding up the computations on an elliptic curve using addition-subtraction chains

Cited in

(5)

• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography
• scientific article; zbMATH DE number 1618061 (Why is no real title available?)
• On \(\tau\)-adic representations of integers
• Analysis of the width-w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices

This page was built for publication: Speeding up the elliptic curve scalar multiplication using non adjacent form

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