On Montgomery-Like Representations for Elliptic Curves over GF(2k)
From MaRDI portal
Publication:4414712
DOI10.1007/3-540-36288-6_18zbMath1033.94541OpenAlexW2154777362MaRDI QIDQ4414712
Publication date: 27 July 2003
Published in: Public Key Cryptography — PKC 2003 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36288-6_18
exponentiationscalar multiplicationpoint multiplicationECCcryptographic applicationsMontgomeryLucas chains
Related Items (5)
Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves ⋮ Montgomery Ladder for All Genus 2 Curves in Characteristic 2 ⋮ Arithmetic of the level four theta model of elliptic curves ⋮ Binary Huff Curves ⋮ The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
This page was built for publication: On Montgomery-Like Representations for Elliptic Curves over GF(2k)