Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
type: Item
instance of: scholarly article
title: Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
zbMATH Open document ID: 1111.94013
author: N. E. Zubov
published in: Information Sciences
publication date: 2007-05-18T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 5154774
zbMATH Keywords: cryptography
zbMATH Keywords: elliptic curve cryptosystems
zbMATH Keywords: scalar multiplication
zbMATH Keywords: power analysis
zbMATH Keywords: highest-weight binary form
MaRDI profile type: Publication
full work available at URL: j.ins.2006.12.016
OpenAlex ID: W2052012720
cites work: Zero-Value Point Attacks on Elliptic Curve Cryptosystem
cites work: Q4502796
cites work: Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
cites work: Q4797391
cites work: Information and Communications Security
cites work: The Doubling Attack – Why Upwards Is Better than Downwards
cites work: Q3043945
cites work: Q4425693
cites work: Q4797813
cites work: Q4425714
cites work: Elliptic Curve Cryptosystems
cites work: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
cites work: Q4941869
cites work: Information Security and Privacy
cites work: A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
cites work: Q3718617
cites work: Q4448412
cites work: Cryptographic Hardware and Embedded Systems - CHES 2004
cites work: An Analysis of Goubin’s Refined Power Analysis Attack
cites work: Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
cites work: Simulatability and security of certificateless threshold signatures
DOI: 10.1016/J.INS.2006.12.016
description: scientific article; zbMATH DE number 5154774