Compact encoding of non-adjacent forms with applications to elliptic curve cryptography

DOI10.1007/3-540-44586-2_26MaRDI QIDQ2724610zbMATH OpenFDO

Authors Marc Joye, Christophe Tymen

Publication date 8 October 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44586-2_26

zbMATH Keywords

compact encodingfast exponentiationnon-adjacent formsnon-adjacent representationspublic-key cryptographyscalar multiplication on elliptic curves

Mathematics Subject Classification ID

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

Recommendations

• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• Speeding up the elliptic curve scalar multiplication using non adjacent form
• Signed bits and fast exponentiation
• Topics in Cryptology – CT-RSA 2005
• Minimality and other properties of the width-𝑤 nonadjacent form

Cited in

(3)

• Every positive integer is the order of an ordinary abelian variety over \(\mathbb{F}_2\)
• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• Speeding up the elliptic curve scalar multiplication using non adjacent form

This page was built for publication: Compact encoding of non-adjacent forms with applications to elliptic curve cryptography

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