Efficient algorithms for Koblitz curves over fields of characteristic three

DOI10.1016/j.jda.2004.04.011zbMath1070.11056OpenAlexW1995833618MaRDI QIDQ1775021

Ian F. Blake, Guangwu Xu, V. Kumar Murty

Publication date: 4 May 2005

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.011

zbMATH Keywords

algorithmselliptic curvescryptographywindows nonadjacent expansion

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices ⋮ Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases ⋮ Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases ⋮ Existence and optimality of \(w\)-non-adjacent forms with an algebraic integer base ⋮ Symmetric digit sets for elliptic curve scalar multiplication without precomputation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient arithmetic on Koblitz curves
• Elliptic Curve Cryptosystems
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field

This page was built for publication: Efficient algorithms for Koblitz curves over fields of characteristic three