4 ms·
Your ELI5 needs an ELI5 :)
by fizwhiz 8y ago
Your ELI5 needs an ELI5 :)
- deleted 8y ago[deleted]
- a-dub 8y agoThey're talking about computing k^m mod p. In the era where you can get a sense for what operations have taken place based on fingerprints left in the cache, timing, etc, the algorithms for computing it are ideally designed to be hardened against it. That is, given knowledge of the sorts of operations that have taken place, how many bits of the secret that is being computed can be recovered? They demonstrate that more bits than previously thought can be practicably recovered from an actual implementation of RSA by using clever statistical modeling and ideas from information theory.
- fizwhiz 8y agoThis is much easier to digest, thank you. What's the significance of computing k^m mod p in this context?