scientific article
From MaRDI portal
Publication:4035791
zbMath0780.14018MaRDI QIDQ4035791
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
primality testCM-curvesefficient Diffie-Hellman cryptosystemsnumber of rational points on anomalous curves
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Complex multiplication and abelian varieties (14K22) Factorization; primality (11A51)
Related Items (42)
Sublinear Scalar Multiplication on Hyperelliptic Koblitz Curves ⋮ A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ Comments on efficient batch verification test for digital signatures based on elliptic curves ⋮ An authenticated key scheme over elliptic curves for topological networks ⋮ Fast elliptic scalar multiplication using new double-base chain and point halving ⋮ Non-commutative digit expansions for arithmetic on supersingular elliptic curves ⋮ A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases ⋮ Exponential sums over points of elliptic curves ⋮ Index calculus in the trace zero variety ⋮ Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases ⋮ Efficient scalar multiplication on Koblitz curves with pre-computation ⋮ 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 ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ On the distribution of the coefficients of normal forms for Frobenius expansions ⋮ Refinement of the four-dimensional GLV method on elliptic curves ⋮ Computing low-weight discrete logarithms ⋮ Binary signed-digit integers and the Stern diatomic sequence ⋮ An optimal representation for the trace zero subgroup ⋮ Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five ⋮ Symmetric digit sets for elliptic curve scalar multiplication without precomputation ⋮ 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 ⋮ Some properties of \(\tau\)-adic expansions on hyperelliptic Koblitz curves ⋮ Koblitz Curves and Integer Equivalents of Frobenius Expansions ⋮ Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic ⋮ On \(\tau\)-adic representations of integers ⋮ Cryptography and elliptic curves ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited ⋮ Expander graphs based on GRH with an application to elliptic curve cryptography ⋮ Koblitz curves over quadratic fields ⋮ Signed bits and fast exponentiation ⋮ A note on window \(\tau\)-NAF algorithm ⋮ The GPS Identification Scheme Using Frobenius Expansions ⋮ Several security schemes constructed using ECC-based self-certified public key cryptosystems ⋮ Point compression for the trace zero subgroup over a small degree extension field ⋮ Improving the parallelized Pollard lambda search on anomalous binary curves ⋮ Linear complexity of sequences on Koblitz curves of genus 2 ⋮ Elliptic curve cryptosystems and their implementation ⋮ On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve
This page was built for publication:
