Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks

DOI10.1016/J.COMPELECENG.2008.06.009zbMATH Open1162.68428OpenAlexW1980304421MaRDI QIDQ1007298FDOQ1007298

Dipanwita Roy Chowdhury, Monjur Alam, Santosh Ghosh, Indranil Gupta

Publication date: 20 March 2009

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2008.06.009

Recommendations

• scientific article; zbMATH DE number 2085437
• scientific article; zbMATH DE number 1941255
• Information Security and Cryptology - ICISC 2003
• scientific article; zbMATH DE number 1955800
• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains

zbMATH Keywords

side channel attackelliptic curve cryptosystemdifferential power analysissimple power analysistiming attackGF\((p)\) EC multiplier

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cited In (9)

• Side-Channel Analysis of Multiplications in GF(2128)
• Efficient FPGA design of exception-free generic elliptic curve cryptosystems
• Title not available (Why is that?)
• Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography
• Cryptographic Hardware and Embedded Systems - CHES 2004
• ECC on Your Fingertips: A Single Instruction Approach for Lightweight ECC Design in GF(p)
• Information Security and Cryptology - ICISC 2003
• Title not available (Why is that?)
• Information Security and Cryptology

This page was built for publication: Parallel crypto-devices for GF\((p)\) elliptic curve multiplication resistant against side channel attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007298)