scientific article; zbMATH DE number 1088245

zbMath0937.94009MaRDI QIDQ4364562

Jorge Guajardo, Christof Paar

Publication date: 14 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityalgorithmselliptic curve cryptosystemssliding window methodimplementationsinversion in composite Galois fieldsKaratsuba-Ofman algorithmpoint doublingspoint multiplication methods

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (9)

An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation ⋮ A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) ⋮ Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON ⋮ The double-base number system and its application to elliptic curve cryptography ⋮ An efficient threshold group signature scheme

This page was built for publication: