scientific article; zbMATH DE number 1302784
From MaRDI portal
Publication:4249254
zbMath0939.11039MaRDI QIDQ4249254
Takatoshi Ono, Atsuko Miyaji, Henri Cohen
Publication date: 2 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16) Plane and space curves (14H50)
Related Items (29)
On binary signed digit representations of integers ⋮ Power attacks on a side-channel resistant elliptic curve implementation ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ The complete cost of cofactor \(h=1\) ⋮ Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ Twisted Hessian Curves ⋮ A note on inverted twisted Edwards curve ⋮ A formula for disaster: a unified approach to elliptic curve special-point-based attacks ⋮ Fast Point Multiplication on Elliptic Curves without Precomputation ⋮ Invariant measures, matching and the frequency of 0 for signed binary expansions ⋮ Faster Addition and Doubling on Elliptic Curves ⋮ A novel elliptic curve scalar multiplication algorithm against power analysis ⋮ Minimality and other properties of the width-𝑤 nonadjacent form ⋮ Toric forms of elliptic curves and their arithmetic ⋮ Formulae for arithmetic on genus 2 hyperelliptic curves ⋮ Twisted Edwards Curves Revisited ⋮ Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace ⋮ The double-base number system and its application to elliptic curve cryptography ⋮ New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields ⋮ Improving the Big Mac Attack on Elliptic Curve Cryptography ⋮ Safe-Errors on SPA Protected Implementations with the Atomicity Technique ⋮ Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System ⋮ Double-base chains for scalar multiplications on elliptic curves ⋮ Эллиптическая пороговая схема разделения секрета ⋮ Jacobi Quartic Curves Revisited ⋮ Faster Pairings on Special Weierstrass Curves ⋮ Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves ⋮ Matching for random systems with an application to minimal weight expansions ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method
This page was built for publication:
