Efficient Scalar Multiplications for Elliptic Curve Cryptosystems Using Mixed Coordinates Strategy and Direct Computations

DOI10.1007/978-3-642-17619-7_14zbMath1294.94061OpenAlexW1574277617MaRDI QIDQ3058763

Abolghasem Saiadian, Roghaie Mahdavi

Publication date: 7 December 2010

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17619-7_14

zbMATH Keywords

Elliptic curve cryptosystemCoordinate systemDirect computationsMixed coordinates strategyScalar multiplication

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Improving Smart Card Security Using Elliptic Curve Cryptography over Prime Field (F p )

This page was built for publication: Efficient Scalar Multiplications for Elliptic Curve Cryptosystems Using Mixed Coordinates Strategy and Direct Computations