Timeline for Why does Shamir's Trick for RSA Work
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2023 at 18:14 | comment | added | fgrieu♦ | Update: and that reference too, in it's note 1. | |
| Nov 5, 2021 at 0:48 | history | became hot network question | |||
| Nov 4, 2021 at 20:27 | comment | added | fgrieu♦ | Yes, I now see it's in Matthieu Rivain, Securing RSA against Fault Analysis by Double Addition Chain Exponentiation (updated version), originally in proceedings of CT-RSA 2009. Still, this reference makes Shamir's Trick synonymous of Simultaneous Exponentiation. | |
| Nov 4, 2021 at 19:36 | comment | added | Johny Dow | @fgrieu It is named Shamir's trick in Topics in Cryptology – CT-RSA 2009 and that's where I got the name from. | |
| Nov 4, 2021 at 19:33 | vote | accept | Johny Dow | ||
| Nov 4, 2021 at 17:26 | comment | added | fgrieu♦ | That's not Shamir's trick as I know it, which computes $x^a\,y^b\bmod n$ at roughly 60% the cost of computing it as $(x^a\bmod n)\,y^b\bmod n$. OTOH Shamir surely has many tricks. Also, while the equation stated holds, that's not the standard countermeasure against fault attacks, which is to check $s^e\bmod n=m$. | |
| Nov 4, 2021 at 16:56 | answer | added | Daniel S | timeline score: 2 | |
| Nov 4, 2021 at 16:47 | history | asked | Johny Dow | CC BY-SA 4.0 |