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.
3 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.
The paper gives tools for CM orientations and Shimura class group actions, including a CM form of Kani's lemma.
An unconditional algorithm solves the supersingular isogeny problem in p to the 1/3-plus-little-o time and memory.
Today 1.6K readers · 2.4K views · 775 reads · all time 189K views