MIST: An efficient, randomized exponentiation algorithm for resisting power analysis

DOI10.1007/3-540-45760-7_5MaRDI QIDQ4472065zbMATH OpenFDO

Authors Colin D. Walter

Publication date 3 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2271/22710053.htm

zbMATH Keywords

addition chainsblindingdivision chainsDPAMIST exponentiation algorithmpower analysissmart card

Mathematics Subject Classification ID

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

Recommendations

• Some security aspects of the MIST randomized exponentiation algorithm
• New power analysis on the Ha-Moon algorithm and the MIST algorithm
• Topics in Cryptology – CT-RSA 2004
• Seeing through MIST given a small fraction of an RSA private key
• Randomized addition-subtraction chains as a countermeasure against power attacks

Cited in

(7)

• MIST
• A duality in space usage between left-to-right and right-to-left exponentiation
• Random Order m-ary Exponentiation
• Seeing through MIST given a small fraction of an RSA private key
• Some security aspects of the MIST randomized exponentiation algorithm
• New power analysis on the Ha-Moon algorithm and the MIST algorithm
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: MIST: An efficient, randomized exponentiation algorithm for resisting power analysis

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