scientific article; zbMATH DE number 2085437

MaRDI QIDQ3043945zbMATH OpenFDO

Authors Tetsuya Izu, Tsuyoshi Takagi

Publication date 9 August 2004

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

zbMATH Keywords

addition formulascurves over finite fieldselliptic curve multiplication algorithmscalar multiplicationside channel attacks

Mathematics Subject Classification ID

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

Recommendations

• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
• scientific article; zbMATH DE number 1941255
• Faster side-channel resistant elliptic curve scalar multiplication
• Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks
• scientific article; zbMATH DE number 1955800

Cited in

(34)

• Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks
• Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves
• Secure and compact elliptic curve LR scalar multiplication
• Speeding up regular elliptic curve scalar multiplication without precomputation
• Improving the arithmetic of elliptic curves in the Jacobi model
• A secure and parallel Montgomery ladder algorithm of ECC
• Complete atomic blocks for elliptic curves in Jacobian coordinates over prime fields
• Arithmetic of split Kummer surfaces: Montgomery endomorphism of Edwards products
• Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate repre\-sentation
• Random Euclidean addition chain generation and its application to point multiplication
• Faster side-channel resistant elliptic curve scalar multiplication
• Parallel formulations of scalar multiplication on Koblitz curves
• Twisted Edwards Curves Revisited
• First-order side channel attacks on Zhang's countermeasures
• scientific article; zbMATH DE number 1941255 (Why is no real title available?)
• scientific article; zbMATH DE number 1955800 (Why is no real title available?)
• scientific article; zbMATH DE number 1962161 (Why is no real title available?)
• scientific article; zbMATH DE number 1980962 (Why is no real title available?)
• scientific article; zbMATH DE number 1759670 (Why is no real title available?)
• A novel elliptic curve scalar multiplication algorithm against power analysis
• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Information Security and Privacy
• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
• The double-base number system and its application to elliptic curve cryptography
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Information Security and Cryptology - ICISC 2003
• Information Security and Cryptology
• T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks
• A formula for disaster: a unified approach to elliptic curve special-point-based attacks
• Differential fault attack on Montgomery ladder and in the presence of scalar randomization
• A fast and SPA secure scalar multiplication for elliptic curve cryptography
• Simpler and faster pairings from the Montgomery ladder
• Efficient elliptic curve scalar multiplication algorithms resistant to power analysis

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