Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields

DOI10.1109/TC.2007.70815MaRDI QIDQ4589547zbMATHOpenAlexFDO

Authors Patrick Longa, A. Miri

Publication date 10 November 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2007.70815

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited in

(11)

• Elliptic curve with Optimal mixed Montgomery-Edwards model for low-end devices
• New fast algorithms for elliptic curve arithmetic in affine coordinates
• Efficient precomputation schemes of \(kP+lQ\)
• Double-base chains for scalar multiplications on elliptic curves
• scientific article; zbMATH DE number 5670187 (Why is no real title available?)
• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• Speeding up regular elliptic curve scalar multiplication without precomputation
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• scientific article; zbMATH DE number 1962162 (Why is no real title available?)
• Fast elliptic curve point multiplication based on window non-adjacent form method
• Speeding up elliptic curve discrete logarithm computations with point halving

This page was built for publication: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields

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