Lukas Giner

Lukas Giner

@giner.cc

Postdoc @Coresec Graz University of Technology

28 followers24 following7 posts

Thank you, very happy to be finally be here 😃

Daniel Gruss@gruss.cc

Congratulations Dr. @giner.cc! It was great to have you in our team and I am proud of you that you have completed this journey with an excellent PhD thesis. Your works will have lasting impact on the community and I wish you the best for your next endeavors!

View full thread

We can also do a modified first-round attack on AES T-Tables, thanks to their innate offset within a page, even though our pattern stretches across all 4 Tables and we can't look at individual lines or even individual Tables. All we need is to know which half of the page sees more accesses!

We find that AMD does ciphertext coherence with cache line granularity, but instead 32 cache lines (half a page)! And even crazier, it's not 32 adjacent cache lines, but they're spread over a page in varying patterns: each accessed line evicts all others in its half of the page.

Now, half a page granularity might not seem very accurate, but the pattern actually helps us quite a bit! For example, we can choose a pattern size that fits the RSA S&M algorithm and recover an entire 4096 bit key with a single trace.

You are up to date.