Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
type: Item
instance of: scholarly article
title: Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
zbMATH Open document ID: 1408.94939
author: Denis Khleborodov
published in: Advances in Computational Mathematics
publication date: 2018-09-05T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 14H52
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6932284
zbMATH Keywords: elliptic curves
zbMATH Keywords: EoT security
zbMATH Keywords: IoT security
zbMATH Keywords: mobile security
zbMATH Keywords: scalar multiplication
zbMATH Keywords: EEC
zbMATH Keywords: lightweight cryptography
MaRDI profile type: Publication
full work available at URL: s10444-017-9581-5
OpenAlex ID: W2772482257
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: Q4426683
cites work: Signed bits and fast exponentiation
cites work: Q2724445
cites work: Sequences of numbers generated by addition in formal groups and new primality and factorization tests
cites work: Trading inversions for multiplications in elliptic curve cryptography
cites work: Q4249254
cites work: Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
cites work: Q4418548
cites work: Elliptic Curve Cryptosystems
cites work: A Survey of Fast Exponentiation Methods
cites work: Q4826108
cites work: Q4349924
cites work: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
cites work: New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
cites work: Q3718617
cites work: Advances in Cryptology – CRYPTO 2004
DOI: 10.1007/S10444-017-9581-5
description: scientific article; zbMATH DE number 6932284