CRYPTO – Pierrick Dartois – A tale of groups and rabbits: efficient 4-dimensional isogeny computations for cryptographic group actions
A tale of groups and rabbits: efficient 4-dimensional isogeny computations for cryptographic group actions In the transition to post-quantum cryptography, cryptographic group actions can offer a modularity close to pre-quantum discrete logarithm problems. Not only can this modularity be used