You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Adding some info we gathered back then with @MihirLuthra.
MbedTLS implements comb methods for scalar multiplication (Algorithm 4 due to an attack by Louis Goubin, MbedTLS code). The first step is to precompute a list of generator multiples that is memory intensive (the list is thus fixed per curve).
To optimize several scalar mults: Precomputed points are cached within an EcGroupwithin each key. It would be great if MbedTLS reused static precomputation tables. This idea was discussed here and added to 3.X here.
This test takes over 20 seconds in SGX on my machine but less than 1 second on Linux. Changing the optimization level seems to have no effect.
The text was updated successfully, but these errors were encountered: