scientific article; zbMATH DE number 1962162

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

ECMelliptic curve arithmeticscalar multiplicationpairing-based cryptosystemElliptic curve cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07) Factorization (11Y05)

Related Items

Group Law Computations on Jacobians of Hyperelliptic Curves ⋮ Multibase scalar multiplications in cryptographic pairings ⋮ Further refinement of pairing computation based on Miller's algorithm ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ Speeding-up verification of digital signatures ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ Efficient Tate pairing computation using double-base chains ⋮ Twisted Edwards Curves Revisited ⋮ 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 ⋮ Jacobi Quartic Curves Revisited ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method

This page was built for publication: