Efficient arithmetic on Koblitz curves
From MaRDI portal
Publication:1976040
DOI10.1023/A:1008306223194zbMath0997.94017OpenAlexW2115190247MaRDI QIDQ1976040
Publication date: 18 August 2002
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008306223194
algorithmselliptic curvespublic key cryptographyKoblitz curvesefficient exponentiationwindowing methods
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (48)
Evaluating the Cache Side Channel Attacks Against ECDSA ⋮ Sublinear Scalar Multiplication on Hyperelliptic Koblitz Curves ⋮ Comments on efficient batch verification test for digital signatures based on elliptic curves ⋮ On binary signed digit representations of integers ⋮ Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography ⋮ Fast elliptic scalar multiplication using new double-base chain and point halving ⋮ Non-commutative digit expansions for arithmetic on supersingular elliptic curves ⋮ Unnamed Item ⋮ Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices ⋮ Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases ⋮ Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases ⋮ Efficient scalar multiplication on Koblitz curves with pre-computation ⋮ Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour ⋮ Balanced non-adjacent forms ⋮ Non-minimality of the width-$w$ non-adjacent form in conjunction with trace one $\tau $-adic digit expansions and Koblitz curves in characteristic two ⋮ Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Random small Hamming weight products with applications to cryptography ⋮ On the distribution of the coefficients of normal forms for Frobenius expansions ⋮ Existence and optimality of \(w\)-non-adjacent forms with an algebraic integer base ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Geometrical aspects of expansions in complex bases ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ On the elliptic curve endomorphism generator ⋮ Minimality and other properties of the width-𝑤 nonadjacent form ⋮ Symmetric digit sets for elliptic curve scalar multiplication without precomputation ⋮ On the minimal Hamming weight of a multi-base representation ⋮ On optimal binary signed digit representations of integers ⋮ Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves ⋮ Efficient algorithms for Koblitz curves over fields of characteristic three ⋮ Koblitz curve cryptosystems ⋮ Distribution of some sequences of points on elliptic curves ⋮ Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves ⋮ Minimal weight expansions in Pisot bases ⋮ Koblitz Curves and Integer Equivalents of Frobenius Expansions ⋮ Unbalanced digit sets and the closest choice strategy for minimal weight integer representations ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ On \(\tau\)-adic representations of integers ⋮ Extractors for binary elliptic curves ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited ⋮ Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication∗ ⋮ Efficient scalar multiplication for elliptic curves over binary fields ⋮ Koblitz curves over quadratic fields ⋮ A note on window \(\tau\)-NAF algorithm ⋮ The GPS Identification Scheme Using Frobenius Expansions ⋮ A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography ⋮ Linear complexity of sequences on Koblitz curves of genus 2 ⋮ Almost Primality of Group Orders of Elliptic Curves Defined over Small Finite Fields
This page was built for publication: Efficient arithmetic on Koblitz curves
