scientific article; zbMATH DE number 708817

zbMath0816.94016MaRDI QIDQ4318708

Kenji Koyama, Yukio Tsuruoka

Publication date: 9 January 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

elliptic curvetime complexitywindow methodelliptic cryptosystems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Elliptic curves (14H52) Computational aspects of algebraic curves (14Q05) Distributed algorithms (68W15)

Related Items

Evaluating the Cache Side Channel Attacks Against ECDSA ⋮ Speeding up the computations of elliptic curves cryptoschemes ⋮ Invariant measures, matching and the frequency of 0 for signed binary expansions ⋮ Minimality and other properties of the width-𝑤 nonadjacent form ⋮ Matching for random systems with an application to minimal weight expansions ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method