Publication:4783726
From MaRDI portal
zbMath1002.94022MaRDI QIDQ4783726
Scott A. Vanstone, Robert P. Gallant, Robert J. Lambert
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390190
Related Items
Easy Decision Diffie-Hellman Groups, О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат, High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions, The soft graphic integer sub-decomposition method for elliptic scalar multiplication, A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder, Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form, ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION, Построение эндоморфизмов алгебраических кривых, О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом, On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve, Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography, A survey of elliptic curves for proof systems, Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves, DiSSECT: distinguisher of standard and simulated elliptic curves via traits, Efficiently computable complex multiplication of elliptic curves, Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists, A new twofold Cornacchia-type algorithm and its applications, Arithmetic on abelian and Kummer varieties, Fast cryptography in genus 2, The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves, Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems, Exponential sums over points of elliptic curves, Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0, Efficient precomputation schemes of \(kP+lQ\), Endomorphisms for faster elliptic curve cryptography on a large class of curves, An optimal representation for the trace zero subgroup, Computing bilinear pairings on elliptic curves with automorphisms, Four-dimensional Gallant-Lambert-Vanstone scalar multiplication, Guest editorial: Special issue in honor of Scott A. Vanstone, Finding shortest lattice vectors faster using quantum search, Some techniques for faster scalar multiplication on GLS curves, Index calculus in the trace zero variety, Comparing two pairing-based aggregate signature schemes, Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves, Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers, Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors, Refinement of the four-dimensional GLV method on elliptic curves, Extending the GLS endomorphism to speed up GHS Weil descent using Magma, New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0, Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms, Revocable hierarchical identity-based authenticated key exchange, Ready-made short basis for GLV+GLS on high degree twisted curves, Efficient hash maps to \(\mathbb{G}_2\) on BLS curves, Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography, Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions, Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems, A taxonomy of pairing-friendly elliptic curves, Point compression for the trace zero subgroup over a small degree extension field, Jacobian coordinates on genus 2 curves, A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity, Hyperelliptic curves with compact parameters, A Multivariate Encryption Scheme with Rainbow, Subgroup Security in Pairing-Based Cryptography, Constructing Isogenies on Extended Jacobi Quartic Curves, Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem, Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors, A Leakage Resilient MAC, Exponentiation in Pairing-Friendly Groups Using Homomorphisms, Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, On Modular Decomposition of Integers
