Defeating countermeasures based on randomized BSD representations

DOI10.1007/978-3-540-28632-5_23MaRDI QIDQ5311446zbMATH OpenOpenAlexFDO

Authors Pierre-Alain Fouque, Frédéric Muller, Guillaume Poupard, F. Valette

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99451

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Cryptanalysis of the countermeasures using randomized binary signed digits
• Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations
• Side-channel analysis of Montgomery's representation randomization
• Selected Areas in Cryptography
• On insecurity of the side channel attack countermeasure using addition-subtraction chains under distinguishability between addition and doubling

Cited in

(9)

• On \(\tau\)-adic representations of integers
• Breaking randomized mixed-radix scalar multiplication algorithms
• On binary signed digit representations of integers
• Side-channel analysis of Montgomery's representation randomization
• Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations
• On insecurity of the side channel attack countermeasure using addition-subtraction chains under distinguishability between addition and doubling
• Cryptanalysis of the countermeasures using randomized binary signed digits
• Efficient countermeasures against RPA, DPA, and SPA
• Progress in Cryptology - INDOCRYPT 2003

This page was built for publication: Defeating countermeasures based on randomized BSD representations

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