Reduce-by-feedback: timing resistant and DPA-aware modular multiplication plus: how to break RSA by DPA

DOI10.1007/978-3-642-33027-8_27zbMATH Open1294.94083OpenAlexW159135798MaRDI QIDQ4649792FDOQ4649792

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1979287
• scientific article; zbMATH DE number 1617927
• scientific article; zbMATH DE number 2079918
• Cryptography and Coding
• A Timing Attack on Blakley’s Modular Multiplication Algorithm, and Applications to DSA

zbMATH Keywords

timing analysisdifferential power analysisMontgomery multiplicationmodular multiplicationReduce-by-Feedback

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• 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}\)
• Title not available (Why is that?)

This page was built for publication: Reduce-by-feedback: timing resistant and DPA-aware modular multiplication plus: how to break RSA by DPA

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