scientific article; zbMATH DE number 1349933

MaRDI QIDQ4265362zbMATH OpenFDO

Authors Gadiel Seroussi, Ian Blake, N. P. Smart

Publication date 11 October 1999

zbMATH Keywords

complex multiplicationelliptic curvescryptographyfinite fieldsECPP algorithmhyperelliptic cryptosystemsSchoof's algorithmAtkin procedureElkies procedure

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Elliptic curves over global fields (11G05) Elliptic curves (14H52)

Recommendations

• scientific article; zbMATH DE number 1727433
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• scientific article; zbMATH DE number 2114384
• scientific article; zbMATH DE number 438988

Cited in

(only showing first 100 items - show all)

• Modular equations for hyperelliptic curves
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• Horizontal racewalking using radical isogenies
• Computing pairings using x-coordinates only
• Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
• Exponential sums over points of elliptic curves
• Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
• An efficient ECDSA-based signature scheme for wireless networks
• Generating anomalous elliptic curves
• Lifting and Elliptic Curve Discrete Logarithms
• Modular polynomials via isogeny volcanoes
• The GN-authenticated key agreement
• Efficient proxy signature schemes using self-certified public keys
• Minimality and other properties of the width-𝑤 nonadjacent form
• Recent progress on the elliptic curve discrete logarithm problem
• A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two
• A note on window \(\tau\)-NAF algorithm
• Improving e-payment security using elliptic curve cryptosystem
• Efficient system parameters for identity-based encryption using supersingular elliptic curves
• Novel hybrid-size digit-serial systolic multiplier over \(\mathrm{GF}(2^m)\)
• Solving some affine equations over finite fields
• Solving \(x+x^{2^l}+\ldots +x^{2^{ml}}=a\) over \(\mathbb{F}_{2^n} \)
• A nonlinear elliptic curve cryptosystem based on matrices
• Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
• Pairing-based cryptography on elliptic curves
• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
• Modular composition modulo triangular sets and applications
• Efficient selective identity-based encryption without random oracles
• Fast arithmetics in Artin-Schreier towers over finite fields
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Self-inversive Hilbert space operator polynomials with spectrum on the unit circle
• Efficient FPGA design of exception-free generic elliptic curve cryptosystems
• A transform property of Kloosterman sums
• Binary Kloosterman sums with value 4
• Counting points on hyperelliptic curves in average polynomial time
• On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
• Complexity bounds on Semaev's naive index calculus method for ECDLP
• Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
• Some lattice attacks on DSA and ECDSA
• Ramanujan's class invariants and their use in elliptic curve cryptography
• Pairings in Trusted Computing
• 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)\)
• Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
• Application of differential cryptography to a GN authentication hierarchy scheme
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Algebraic curves and cryptography
• The "Elliptic" matrices and a new kind of cryptography
• Construction of strong elliptic curves suitable for cryptographic applications
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Subgroup security in pairing-based cryptography
• Efficient algorithms for Koblitz curves over fields of characteristic three
• On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
• Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over \(\mathrm{GF}(p)\)
• Advances in Elliptic Curve Cryptography
• Computing the $\ell $-power torsion of an elliptic curve over a finite field
• On the arithmetic operations over finite fields of characteristic three with low complexity
• scientific article; zbMATH DE number 438988 (Why is no real title available?)
• New lattice attacks on DSA schemes
• scientific article; zbMATH DE number 2042246 (Why is no real title available?)
• Protecting ECC against fault attacks: the ring extension method revisited
• On oracle factoring of integers
• Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
• Small exponent point groups on elliptic curves
• The generalized Weil pairing and the discrete logarithm problem on elliptic curves
• High-performance generic-point parallel scalar multiplication
• Comments on efficient batch verification test for digital signatures based on elliptic curves
• Algebraic approaches for solving isogeny problems of prime power degrees
• Digit Set Randomization in Elliptic Curve Cryptography
• Implementing elliptic curve cryptography
• On automorphism groups of cyclotomic function fields over finite fields
• scientific article; zbMATH DE number 1936525 (Why is no real title available?)
• Constructive and destructive use of compilers in elliptic curve cryptography
• Polynomial interpolation of the Naor-Reingold pseudo-random function
• Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability
• An efficient deterministic test for Kloosterman sum zeros
• Elliptic curves. Number theory and cryptography
• Closed formulae for the Weil pairing inversion
• scientific article; zbMATH DE number 7303241 (Why is no real title available?)
• 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
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
• scientific article; zbMATH DE number 1440061 (Why is no real title available?)
• On the Security of Supersingular Isogeny Cryptosystems
• Elliptic curves. An elementary exposition for cryptography.
• Cryptographic hash functions from expander graphs
• scientific article; zbMATH DE number 1727433 (Why is no real title available?)
• On the efficient generation of prime-order elliptic curves
• A public key cryptoscheme using bit-pairs with provable semantical security
• Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
• A note on factorisation patterns of division polynomials of elliptic curves over finite fields
• Kummer and Hessian meet in the field of characteristic 2
• Irreducible compositions of polynomials over finite fields of even characteristic
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Algebraic cryptography: new constructions and their security against provable break
• Cryptography on elliptic curves over \(p\) -adic number fields
• scientific article; zbMATH DE number 6262935 (Why is no real title available?)
• Constructive and destructive facets of Weil descent on elliptic curves

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265362)