scientific article; zbMATH DE number 2058638
From MaRDI portal
Publication:4455274
Recommendations
Cited in
(14)- A dual finite fields algorithm for elliptic curve cryptosystem and FPGA implementation
- Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic
- Efficient elliptic curve exponentiation
- Fast algorithms for elliptic curve cryptosystems over binary finite field
- Fast implementation of elliptic curve defined over \(\text{GF}(p^m)\) on \(\text{CalmRISC}\) with \(\text{MAC}2424\) coprocessor
- A fast software implementation for arithmetic operations in \(\text{GF}(2^n)\)
- An improved implementation of elliptic curves over GF(2) when using projective point arithmetic
- A secure family of composite finite fields suitable for fast implementation of elliptic curve cryptography. (Extended abstract)
- Fast implementation of elliptic curve arithmetic in GF(p^n)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
- Elliptic curve cryptography arithmetic in terms of one variable polynomial division
- scientific article; zbMATH DE number 2232692 (Why is no real title available?)
- A comparison of different finite fields for elliptic curve cryptosystems
- Efficient software-implementation of finite fields with applications to cryptography
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 Q4455274)