>Their attack uses binary search to recover the private RSA key after 1023 client logins I know this is from the initial paper but it is great to see practical examples of algorithms taught in college/uni. I always had trouble understanding why we are learning such hard topics to find the number 5 in a sorted list of 10 numbers. To keep things on topic. >The patches that MEGA developed to mitigate the original key re…
The OP proudly showed off a custom B-Tree implementation for a problem where a sorted array and binary search would be far simpler and much faster in practice.
Applying even a smidge more CS knowledge could have resulted in using Netwon's Iteration as the lookup, which is the almost perfectly optimal solution: just one random I/O to do a lookup even with a cold cache!