scientific article; zbMATH DE number 1304119

zbMath0937.94007MaRDI QIDQ4250817

Ricardo Dahab, Julio López

Publication date: 6 June 2000

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

zbMATH Keywords

algorithmscryptographyelliptic curve arithmetic

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20)

Related Items (10)

A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates ⋮ High-performance generic-point parallel scalar multiplication ⋮ On binary signed digit representations of integers ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ Efficient scalar multiplication on Koblitz curves with pre-computation ⋮ Montgomery Ladder for All Genus 2 Curves in Characteristic 2 ⋮ Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited ⋮ High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms ⋮ A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography

This page was built for publication: