scientific article; zbMATH DE number 1759670

MaRDI QIDQ4536672zbMATH OpenFDO

Authors Katsuyuki Okeya, Kunihiko Miyazaki, Kouichi Sakurai

Publication date 23 November 2002

zbMATH Keywords

elliptic curve cryptosystemMontgomery form elliptic curvesrandomized projective coordinates methodscalar multiplicationside channel attacks

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Faster side-channel resistant elliptic curve scalar multiplication
• scientific article; zbMATH DE number 2085437
• Side-channel analysis of Montgomery's representation randomization
• scientific article; zbMATH DE number 1955800
• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains

Cited in

(7)

• Side-channel analysis of Montgomery's representation randomization
• Faster side-channel resistant elliptic curve scalar multiplication
• Power analysis to ECC using differential power between multiplication and squaring
• Coordinate blinding over large prime fields
• scientific article; zbMATH DE number 1878328 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Information Security and Privacy

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