Shorter addition chain for smooth integers using decomposition method

DOI10.1080/00207160.2010.543456MaRDI QIDQ3101616zbMATH OpenOpenAlexFDO

Authors

Publication date 29 November 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL http://psasir.upm.edu.my/id/eprint/25154/1/Shorter%20addition%20chain%20for%20smooth%20integers%20using%20decomposition%20method.pdf

zbMATH Keywords

elliptic curve cryptographyscalar multiplicationnon-adjacent formcomplementary recodingbinary method

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• A method for the efficient computation of scalar multiplication in Koblitz curve
• scientific article; zbMATH DE number 2085440
• New strategy for doubling-free short addition-subtraction chain
• scientific article; zbMATH DE number 1951601
• scientific article; zbMATH DE number 1612501

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Computing Sequences with Addition Chains
• Elliptic curve scalar multiplication algorithm using complementary recoding
• Minimizing sums of addition chains
• On addition chains
• On the Evaluation of Powers

Cited in

(2)

• Rule based representation of integer for a new addition chain method
• Fast endomorphisms in integer sub-decomposition method on Secp192k1

This page was built for publication: Shorter addition chain for smooth integers using decomposition method

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