scientific article; zbMATH DE number 1962161

MaRDI QIDQ4418547zbMATH OpenFDO

Authors Katsuyuki Okeya, Tsuyoshi Takagi

Publication date 10 August 2003

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

zbMATH Keywords

Elliptic curve cryptosystemmemory constraintpre-computation tableside channel attackssmart cardwidth-w NAF

Mathematics Subject Classification ID

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

Recommendations

• A more flexible countermeasure against side channel attacks using window method.
• An efficient method against side-channel attacks on ECC
• scientific article; zbMATH DE number 1950345
• Some ways to secure elliptic curve cryptosystems
• scientific article; zbMATH DE number 2085437

Cited in

(11)

• Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
• Speeding up regular elliptic curve scalar multiplication without precomputation
• Exponent Recoding and Regular Exponentiation Algorithms
• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• Small scalar multiplication on Weierstrass curves using division polynomials
• Speeding up the elliptic curve scalar multiplication using non adjacent form
• A more flexible countermeasure against side channel attacks using window method.
• T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks
• Optimizing and securing GLV multiplication over BLS pairings-friendly curves
• A new multiscalar multiplication method resistant to timing attacks
• Four-dimensional Gallant-Lambert-Vanstone scalar multiplication

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 Q4418547)