2 Hits in 2.3 sec

CTIDH: faster constant-time CSIDH

Gustavo Banegas, Daniel J. Bernstein, Fabio Campos, Tung Chou, Tanja Lange, Michael Meyer, Benjamin Smith, Jana Sotáková
2021 Transactions on Cryptographic Hardware and Embedded Systems  
This paper introduces a new key space for CSIDH and a new algorithm for constant-time evaluation of the CSIDH group action.  ...  For example, for CSIDH-512 with a 256-bit key space, the best previous constant-time results used 789000 multiplications and more than 200 million Skylake cycles; this paper uses 438006 multiplications  ...  The SIMBA approach is generalized in [15] with point-pushing strategies within prides, more efficient partitions of SIMBA prides, and their permutations.  ... 
doi:10.46586/tches.v2021.i4.351-387 fatcat:nr4ue2uyqndzjl6luqbwb7tuse

Dagstuhl Reports, Volume 9, Issue 10, October 2019, Complete Issue

It was mentioned that the idea of super-and submartingales also generalizes to vectors of random variables. This might yield a useful approach to tackle this problem.  ...  Particularly, with the growth of population size λ a higher mutation rate bound of 1/n is more efficient than 1/n 2 .  ...  Martin and Thatte [1] improves the lower bound to Ω( √ log n) and conjectured that a lower bound of Ω( √ n) if both trees are balanced.  ... 
doi:10.4230/dagrep.9.10 fatcat:4dvf4zjt4nhafhwb4ot23au3ua