Elliptic curve cryptosystems over small fields of odd characteristic
From MaRDI portal
Publication:1291807
Recommendations
Cited in
(16)- Comments on efficient batch verification test for digital signatures based on elliptic curves
- On index calculus algorithms for subfield curves
- Application of differential cryptography to a GN authentication hierarchy scheme
- Finite field arithmetic using quasi-normal bases
- On finite fields for pairing based cryptography
- Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves
- Koblitz curve cryptosystems
- A comparison of different finite fields for elliptic curve cryptosystems
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- On the elliptic curve endomorphism generator
- Linear complexity of sequences on Koblitz curves of genus 2
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
- On counting and generating curves over small finite fields
- Distribution of some sequences of points on elliptic curves
- Efficient hardware implementation of finite fields with applications to cryptography
- On the distribution of the coefficients of normal forms for Frobenius expansions
This page was built for publication: Elliptic curve cryptosystems over small fields of odd characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291807)