Publication:4418548
From MaRDI portal
zbMath1038.11079arXivmath/0208038MaRDI QIDQ4418548
Kirsten Eisenträger, Peter L. Montgomery, Kristin E. Lauter
Publication date: 10 August 2003
Full work available at URL: https://arxiv.org/abs/math/0208038
ECM; elliptic curve arithmetic; scalar multiplication; pairing-based cryptosystem; Elliptic curve cryptosystem
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
14G50: Applications to coding theory and cryptography of arithmetic geometry
11G07: Elliptic curves over local fields
11Y05: Factorization
Related Items
The double-base number system and its application to elliptic curve cryptography, New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields, Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations, Multibase scalar multiplications in cryptographic pairings, Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis, Efficient Tate pairing computation using double-base chains, Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods, Fast elliptic curve point multiplication based on window non-adjacent form method, Further refinement of pairing computation based on Miller's algorithm, Group Law Computations on Jacobians of Hyperelliptic Curves, Twisted Edwards Curves Revisited, Jacobi Quartic Curves Revisited
