scientific article; zbMATH DE number 1349933
From MaRDI portal
Publication:4265362
zbMATH Open0937.94008MaRDI QIDQ4265362FDOQ4265362
Authors: Gadiel Seroussi, Ian Blake, N. P. Smart 
Publication date: 11 October 1999
Title of this publication is not available (Why is that?)
Recommendations
complex multiplicationelliptic curvescryptographyfinite fieldsECPP algorithmhyperelliptic cryptosystemsSchoof's algorithmAtkin procedureElkies procedure
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Elliptic curves over global fields (11G05) Elliptic curves (14H52)
Cited In (only showing first 100 items - show all)
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- Lifting and Elliptic Curve Discrete Logarithms
- A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two
- Improving e-payment security using elliptic curve cryptosystem
- 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} \)
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
- Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
- Pairing-based cryptography on elliptic curves
- Self-inversive Hilbert space operator polynomials with spectrum on the unit circle
- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Ramanujan's class invariants and their use in elliptic curve cryptography
- Subgroup security in pairing-based cryptography
- On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
- On the arithmetic operations over finite fields of characteristic three with low complexity
- Protecting ECC against fault attacks: the ring extension method revisited
- On oracle factoring of integers
- Small exponent point groups 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
- Implementing elliptic curve cryptography
- 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
- 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
- Title not available (Why is that?)
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
- Irreducible compositions of polynomials over finite fields of even characteristic
- Title not available (Why is that?)
- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- Finding the Eigenvalue in Elkies' Algorithm
- Spreading alerts quietly and the subgroup escape problem
- Finding smooth integers in short intervals using CRT decoding
- Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
- A kind of good elliptic curve used to set up cryptosystem
- On algorithmic constructions of isogenies of elliptic curves over finite fields and their applications
- Self-certified multi-proxy signature schemes with message recovery
- Formalization of definitions and theorems related to an elliptic curve over a finite prime field by using Mizar
- Choosing the correct elliptic curve in the CM method
- Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- Operations of points on elliptic curve in affine coordinates
- A blind signature scheme based on bilinear pairings
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
- Elliptic curves for applications
- A note on the kernel of group homomorphism of the Weil descent method
- A Tree-Based Approach for Computing Double-Base Chains
- Computing pairings using \(x\)-coordinates only
- Exponential sums over points of elliptic curves
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Modular polynomials via isogeny volcanoes
- Minimality and other properties of the width-𝑤 nonadjacent form
- Generating anomalous elliptic curves
- Recent progress on the elliptic curve discrete logarithm problem
- A note on window \(\tau\)-NAF algorithm
- A nonlinear elliptic curve cryptosystem based on matrices
- Efficient selective identity-based encryption without random oracles
- Modular composition modulo triangular sets and applications
- Fast arithmetics in Artin-Schreier towers over finite fields
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- A transform property of Kloosterman sums
- Binary Kloosterman sums with value 4
- Counting points on hyperelliptic curves in average polynomial time
- Algebraic curves and cryptography
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Pairings in Trusted Computing
- Some lattice attacks on DSA and ECDSA
- 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)\)
- Advances in Elliptic Curve Cryptography
- Efficient algorithms for Koblitz curves over fields of characteristic three
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Computing the $\ell $-power torsion of an elliptic curve over a finite field
- Title not available (Why is that?)
- New lattice attacks on DSA schemes
- Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- Title not available (Why is that?)
- On automorphism groups of cyclotomic function fields over finite fields
- Elliptic curves. Number theory and cryptography
- An efficient deterministic test for Kloosterman sum zeros
- Closed formulae for the Weil pairing inversion
- Title not available (Why is that?)
- On the Security of Supersingular Isogeny Cryptosystems
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Cryptographic hash functions from expander graphs
- 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
- Constructive and destructive facets of Weil descent on elliptic curves
- Type-Based Proxy Re-encryption and Its Construction
- Elliptic curves and their applications to cryptography. An introduction
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)
