Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA

DOI10.1007/978-3-642-33027-8_27zbMath1294.94083OpenAlexW159135798MaRDI QIDQ4649792

Michael Vielhaber

Publication date: 13 November 2012

Published in: Cryptographic Hardware and Embedded Systems – CHES 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33027-8_27

zbMATH Keywords

timing analysisdifferential power analysisMontgomery multiplicationmodular multiplicationReduce-by-Feedback

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Computation of functions on \(n\) bits by asynchronous clocking of cellular automata ⋮ Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)

This page was built for publication: Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA