Publication:4265362

Gadiel Seroussi, Ian F. Blake, Nigel P. Smart

Publication date: 11 October 1999

elliptic curves; finite fields; cryptography; complex multiplication; ECPP algorithm; hyperelliptic cryptosystems; Schoof's algorithm; Atkin procedure; Elkies procedure

Mathematics Subject Classification ID

94A60: Cryptography

11G05: Elliptic curves over global fields

94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory

14H52: Elliptic curves

Related Items

Finding the Eigenvalue in Elkies' Algorithm, Modular equations for hyperelliptic curves, On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves, Modular polynomials via isogeny volcanoes, Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication, Type-Based Proxy Re-encryption and Its Construction, Finding smooth integers in short intervals using CRT decoding, Minimality and other properties of the width-𝑤 nonadjacent form, Algebraic curves and cryptography, A comparison of different finite fields for elliptic curve cryptosystems, On the efficient generation of prime-order elliptic curves, A public key cryptosystem based on three new provable problems, Fast arithmetics in Artin-Schreier towers over finite fields, Some lattice attacks on DSA and ECDSA, Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography, Endomorphisms for faster elliptic curve cryptography on a large class of curves, The generalized Weil pairing and the discrete logarithm problem on elliptic curves, Efficient selective identity-based encryption without random oracles, Private key agreement and secure communication for heterogeneous sensor networks, A transform property of Kloosterman sums, Asymptotic granularity reduction and its application, Generating anomalous elliptic curves, A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point, Efficient software-implementation of finite fields with applications to cryptography, Hardware implementation of finite-field division, On the complexity of parallel algorithms for computing inverses in $\text{GF}(2^m)$ with $m$ prime, Scalable and systolic architecture for computing double exponentiation over $\text{GF}(2^m)$, Small exponent point groups on elliptic curves, Closed formulae for the Weil pairing inversion, The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups, Improving e-payment security using elliptic curve cryptosystem, Ramanujan's class invariants and their use in elliptic curve cryptography, Computing pairings using $x$-coordinates only, Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits, Constructive and destructive use of compilers in elliptic curve cryptography, Cryptographic hash functions from expander graphs, A note on window $\tau$-NAF algorithm, Self-certified multi-proxy signature schemes with message recovery, On the relationship between squared pairings and plain pairings, Constructive and destructive facets of Weil descent on elliptic curves, A note on the $x$-coordinate of points on an elliptic curve in characteristic two, Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability, Efficient algorithms for Koblitz curves over fields of characteristic three, On the complexity of the discrete logarithm and Diffie-Hellman problems, Computing zeta functions of Artin-Schreier curves over finite fields. II, Recurrent methods for constructing irreducible polynomials over $\mathbb F_{q}$ of odd characteristics., Further refinement of pairing computation based on Miller's algorithm, Analysis and design of a secure key exchange scheme, Short signatures without random oracles and the SDH assumption in bilinear groups, Cryptography on elliptic curves over $p$ -adic number fields, All-in-one group-oriented cryptosystem based on bilinear pairing, Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography, Computing the height of volcanoes of $\ell $-isogenies of elliptic curves over finite fields, A nonlinear elliptic curve cryptosystem based on matrices, How to compute modular exponentiation with large operators based on the right-to-left binary algorithm, On the bit security of the Diffie-Hellman key, The GN-authenticated key agreement, Efficient algorithms for speeding up the computations of elliptic curve cryptosystems, Efficient proxy signature schemes using self-certified public keys, Computing the $\ell $-power torsion of an elliptic curve over a finite field, Algebraic cryptography: new constructions and their security against provable break, Computing Hilbert class polynomials with the Chinese remainder theorem, Binary Kloosterman Sums with Value 4, Efficient scalar multiplication for elliptic curves over binary fields, An efficient ECDSA-based signature scheme for wireless networks, A Tree-Based Approach for Computing Double-Base Chains, Fast algorithms for computing isogenies between elliptic curves, Choosing the correct elliptic curve in the CM method, Pairings in Trusted Computing, Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves, Exponent Recoding and Regular Exponentiation Algorithms, Lifting and Elliptic Curve Discrete Logarithms