scientific article; zbMATH DE number 1962161

zbMath1039.94519MaRDI QIDQ4418547

Tsuyoshi Takagi, Katsuyuki Okeya

Publication date: 10 August 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2612/26120328.htm

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

zbMATH Keywords

smart cardside channel attacksElliptic curve cryptosystemmemory constraintpre-computation tablewidth-w NAF

Mathematics Subject Classification ID

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

Related Items (8)

Small scalar multiplication on Weierstrass curves using division polynomials ⋮ Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ Four-dimensional Gallant-Lambert-Vanstone scalar multiplication ⋮ Exponent Recoding and Regular Exponentiation Algorithms

This page was built for publication: