Elliptic curve cryptosystems over small fields of odd characteristic
From MaRDI portal
Publication:1291807
DOI10.1007/PL00003820zbMATH Open0938.94008OpenAlexW2091987928MaRDI QIDQ1291807FDOQ1291807
Publication date: 18 June 2000
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00003820
Recommendations
Cryptography (94A60) Elliptic curves over global fields (11G05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cited In (16)
- On finite fields for pairing based cryptography
- Linear complexity of sequences on Koblitz curves of genus 2
- Distribution of some sequences of points on elliptic curves
- On index calculus algorithms for subfield curves
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- On the elliptic curve endomorphism generator
- Finite field arithmetic using quasi-normal bases
- On counting and generating curves over small finite fields
- Comments on efficient batch verification test for digital signatures based on elliptic curves
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
- A comparison of different finite fields for elliptic curve cryptosystems
- On the distribution of the coefficients of normal forms for Frobenius expansions
- Title not available (Why is that?)
- Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves
- Koblitz curve cryptosystems
- Efficient hardware implementation of finite fields with applications to cryptography
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)
