Publication:4364562
From MaRDI portal
zbMath0937.94009MaRDI QIDQ4364562
Publication date: 14 June 2000
complexity; algorithms; elliptic curve cryptosystems; sliding window method; implementations; inversion in composite Galois fields; Karatsuba-Ofman algorithm; point doublings; point multiplication methods
Related Items
The double-base number system and its application to elliptic curve cryptography, A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates, Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis, An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation, Efficient hardware implementation of finite fields with applications to cryptography, Optimal Karatsuba-like formulae for certain bilinear forms in GF(2), An efficient threshold group signature scheme, Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON, MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity