Speeding up the elliptic curve scalar multiplication using non adjacent form

DOI10.1080/09720529.2015.1023538OpenAlexW2286039514MaRDI QIDQ5069746FDOQ5069746

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

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

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)

Cites Work

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

Cited In (4)

• 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
• Title not available (Why is that?)
• On \(\tau\)-adic representations of integers

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)