scientific article; zbMATH DE number 1842492
From MaRDI portal
Publication:4783726
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Arithmetic on abelian and Kummer varieties, Fast cryptography in genus 2, The soft graphic integer sub-decomposition method for elliptic scalar multiplication, Ready-made short basis for GLV+GLS on high degree twisted curves, A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder, Efficient hash maps to \(\mathbb{G}_2\) on BLS curves, Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors, The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves, A Leakage Resilient MAC, Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography, Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form, Jacobian coordinates on genus 2 curves, Easy Decision Diffie-Hellman Groups, Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves, Subgroup Security in Pairing-Based Cryptography, A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity, 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, Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems, Exponential sums over points of elliptic curves, 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, Index calculus in the trace zero variety, DiSSECT: distinguisher of standard and simulated elliptic curves via traits, Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0, 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, Computing bilinear pairings on elliptic curves with automorphisms, Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers, Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors, The special case of cyclotomic fields in quantum algorithms for unit groups, Efficient precomputation schemes of \(kP+lQ\), Endomorphisms for faster elliptic curve cryptography on a large class of curves, Constructing Isogenies on Extended Jacobi Quartic Curves, Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions, Extending the GLS endomorphism to speed up GHS Weil descent using Magma, ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION, Построение эндоморфизмов алгебраических кривых, О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом, Refinement of the four-dimensional GLV method on elliptic curves, Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems, New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0, An optimal representation for the trace zero subgroup, Comparing two pairing-based aggregate signature schemes, A taxonomy of pairing-friendly elliptic curves, Exponentiation in Pairing-Friendly Groups Using Homomorphisms, A Multivariate Encryption Scheme with Rainbow, О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат, High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions, Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, Four-dimensional Gallant-Lambert-Vanstone scalar multiplication, Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem, On Modular Decomposition of Integers, Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms, Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography, Hyperelliptic curves with compact parameters, Point compression for the trace zero subgroup over a small degree extension field, Revocable hierarchical identity-based authenticated key exchange, On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve
