DOI: 10.1007/978-3-642-33027-8_27
关键词:
摘要: We (re-) introduce the Reduce-By-Feedback scheme given by Vielhaber (1987), Benaloh and Dai (1995), Jeong Burleson (1997). We show, how to break RSA, when implemented with standard version of Reduce-by-Feedback or Montgomery multiplication, Differential Power Analysis. then modify avoid this attack. The modification is not possible for multiplication. We show that both original modified algorithm resist timing attacks. Furthermore, some VLSI-specific implementation details (delayed carry adder, re-use MUX tree logic) are provided.