4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.CR2009
Normal Elliptic Bases and Torus-Based Cryptography
Clement Dunand, Reynald Lercier
We consider representations of algebraic tori over finite fields. We make use of normal elliptic bases to show that, for infinitely many squarefree integers and infi…
math.NT2009★ 4 cited
On Modular Inverses of Cyclotomic Polynomials and the Magnitude of their Coefficients
Clement Dunand
Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coeff…