scientific article; zbMATH DE number 1962162

MaRDI QIDQ4418548zbMATH OpenFDO

Authors Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery

Publication date 10 August 2003

Full work available at URL https://arxiv.org/abs/math/0208038, http://link.springer.de/link/service/series/0558/bibs/2612/26120343.htm

zbMATH Keywords

ECMelliptic curve arithmeticElliptic curve cryptosystempairing-based cryptosystemscalar multiplication

Mathematics Subject Classification ID

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

Recommendations

• Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
• scientific article; zbMATH DE number 2009969
• scientific article; zbMATH DE number 1440071
• Information Security and Privacy
• Faster Ate pairing computation on Selmer's model of elliptic curves
• Speeding up the computations of elliptic curves cryptoschemes
• Faster Addition and Doubling on Elliptic Curves
• Efficient pairing computation on elliptic curves in Hessian form
• New fast algorithms for elliptic curve arithmetic in affine coordinates
• Efficient arithmetic on elliptic curve cryptography

Cited in

(35)

• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• The Weil pairing, and its efficient calculation
• New fast algorithms for elliptic curve arithmetic in affine coordinates
• Fast group operations on elliptic curves in Maple
• Accelerating beta Weil pairing with precomputation and multi-pairing techniques
• Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
• Speeding-up verification of digital signatures
• Fast elliptic curve point multiplication based on window non-adjacent form method
• Further refinement of pairing computation based on Miller's algorithm
• The geometry of efficient arithmetic on elliptic curves
• Group law computations on Jacobians of hyperelliptic curves
• Multibase scalar multiplications in cryptographic pairings
• Fast Hashing to G 2 on Pairing-Friendly Curves
• scientific article; zbMATH DE number 5670187 (Why is no real title available?)
• Twisted Edwards Curves Revisited
• Jacobi Quartic Curves Revisited
• Analysis and optimization of elliptic-curve single-scalar multiplication
• scientific article; zbMATH DE number 1951601 (Why is no real title available?)
• scientific article; zbMATH DE number 2085210 (Why is no real title available?)
• Efficient computation of pairings on Jacobi quartic elliptic curves
• Bilinear pairing computation using the extended double-base chains algorithm
• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
• Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems
• 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
• Algorithmic Number Theory
• EAGL: an elliptic curve arithmetic GPU-based library for bilinear pairing
• Information Security and Cryptology
• Public Key Cryptography - PKC 2006
• Pairings in rank-1 constraint systems
• Fast elliptic curve scalar multiplications in SN(T)ARK circuits
• Revisiting subgroup membership testing on pairing-friendly curves via the Tate pairing
• Efficient Tate pairing computation using double-base chains

This page was built for publication:

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