Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields

DOI10.1109/TC.2007.70815zbMath1374.94794OpenAlexW2122183684MaRDI QIDQ4589547

Patrick Longa, Ali 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

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

Related Items (7)

Elliptic curve with Optimal mixed Montgomery-Edwards model for low-end devices ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ Efficient precomputation schemes of \(kP+lQ\) ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields ⋮ Double-base chains for scalar multiplications on elliptic curves ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method

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