Abstract
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. The result extends an earlier result of Z. Chen on the trace of binary sequences derived from Fermat quotients modulo a prime. However, the case of composite modulus brings some interesting twists. Trace representation can help us producing the sequences efficiently and analyzing their cryptographic properties, such as linear complexity.