Please use this identifier to cite or link to this item:
|Title:||On double exponentiation for securing RSA against fault analysis||Authors:||Le, D.-P.
|Issue Date:||2014||Citation:||Le, D.-P.,Rivain, M.,Tan, C.H. (2014). On double exponentiation for securing RSA against fault analysis. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8366 LNCS : 152-168. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-319-04852-9_8||Abstract:||At CT-RSA 2009, a new principle to secure RSA (and modular/group exponentiation) against fault-analysis has been introduced by Rivain. The idea is to perform a so-called double exponentiation to compute a pair (m d, mφ(N)-d) and then check that the output pair satisfies the consistency relation: md · m φ(N)-d ≡ 1 mod N. The author then proposed an efficient heuristic to derive an addition chain for the pair (d, φ(N) - d). In this paper, we revisit this idea and propose faster methods to perform a double exponentiation. On the one hand, we present new heuristics for generating shorter double addition chains. On the other hand, we present an efficient double exponentiation algorithm based on a right-to-left sliding window approach. © 2014 Springer International Publishing.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/128933||ISBN:||9783319048512||ISSN:||16113349||DOI:||10.1007/978-3-319-04852-9_8|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.