25 citations · 71 across the 16 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022★ 1 cited
Random primes in arithmetic progressions
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray +1
We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm al…
cs.CC2010★ 11 cited
On Polynomial Multiplication in Chebyshev Basis
Pascal Giorgi
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyno…