Trace representation of pseudorandom binary sequences derived from Euler quotients

This work addresses cryptographic sequence design for security applications, but it is incremental as it builds on existing Euler quotient sequences.

The paper tackled the problem of efficiently generating and analyzing cryptographic properties of binary sequences derived from Euler quotients by providing their trace representation and determining defining polynomials, resulting in a method to assess linear complexity.