Improvements to RSA key generation and CRT on embedded devices.
Mike Hamburg, Michael Tunstall, Qinglai Xiao · IACR Cryptology ePrint Archive · 2020
RSA key generation requires devices to generate large prime numbers. The naive approach is to generate candidates at random, and then test each one for (probable) primality. However, it is faster to use a sieve method, where the candidates are chosen so as not to be divisible by a list of small prime numbers \(\{p_i\}\).