4 ms·
Could somebody explain this like I am 5 years old?
by brian_herman__ 8y ago
Could somebody explain this like I am 5 years old?
- scottlocklin 8y agoWhile working on the tail end of a side channel attack paper, the author came up with a new analytic form for Renyi entropy used in the type of hidden markov model used in the side channel attack. Pretty solid piece of work. I am not super familiar with the use of Renyi entropy in HMMs, but it looks pretty generally interesting; something that can be used to find recurrence maps in general.
- fizwhiz 8y agoYour 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?
- MediumD 8y agoI want to meet the 5 year old that can understand this.
- brian_herman__ 8y agoThanks I’ll have to brush up on my computer science theory before tackling this.