Niall Emmart

[Niall Emmart @nemmart1]

@bfarmer We used it extensive in for NTTs in 2011. See "High precision integer multiplication with a GPU using Strassen's algorithm with multiple FFT sizes" by Emmart and Weems, and "VLSI design of a large-number multiplier for fully homomorphic encryption" by Wang et al.

[2/2]

[Niall Emmart @nemmart1]

@bfarmer This field has been known for a long time. See the "Generalized Mersenne Primes" by Solinas, 1997. The actual prime 2^64-2^32+1 is listed in the appendix of "Solinas primes of small weight for fixed size" by Angel, 1999.

[1/2]