Fault attack recovers deterministic CSIDH and OSIDH-LD keys
A binary search over faulted lane masks needs at most 297 queries for OSIDH-LD and 222 for CSIDH-512-sized keys.
1 stories, newest first · one card per story
A binary search over faulted lane masks needs at most 297 queries for OSIDH-LD and 222 for CSIDH-512-sized keys.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views