Elliptic curve cryptosystems over small fields of odd characteristic
From MaRDI portal
The author generalizes the method of \textit{V. Müller} [Fast multiplication on elliptic curves over small fields of characteristic 2, J. Cryptology 11, 219-234 (1998; Zbl 0945.11024)] to finite fields of odd characteristic. He discusses the cryptographical merits of elliptic curves over prime fields, and over finite fields of small odd characteristic with respect to those defined over finite fields of characteristic 2.
Recommendations
Cited in
(17)- On the elliptic curve endomorphism generator
- Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves
- Koblitz curve cryptosystems
- On counting and generating curves over small finite fields
- Linear complexity of sequences on Koblitz curves of genus 2
- Comments on efficient batch verification test for digital signatures based on elliptic curves
- Finite field arithmetic using quasi-normal bases
- On finite fields for pairing based cryptography
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- Application of differential cryptography to a GN authentication hierarchy scheme
- The Q-curve construction for endomorphism-accelerated elliptic curves
- Distribution of some sequences of points on elliptic curves
- A comparison of different finite fields for elliptic curve cryptosystems
- On the distribution of the coefficients of normal forms for Frobenius expansions
- Beyond the circuit -- how to minimize foreign arithmetic in ZKP circuits
- On index calculus algorithms for subfield curves
- 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)
