# Improved lower bound on the family complexity of Legendre sequences

## TL;DR

This paper improves the lower bound on the family complexity of binary Legendre sequences, a measure of pseudorandomness, providing a more accurate estimate and a fast calculation method.

## Contribution

The authors enhance Gyarmati's previous bound on family complexity for Legendre sequences, incorporating the Lambert W function and subfield elements, along with a new efficient computation method.

## Key findings

- Improved lower bound on family complexity using Lambert W function
- Derived a faster method for calculating the bound
- Bound depends on subfield elements in finite fields

## Abstract

In this paper we study a family of binary Legendre sequences and its family complexity. Family complexity is a pseudorandomness measure introduced by Ahlswede et.~al.~in 2003. A lower bound on the family complexity of a family based on the Legendre symbol of polynomials over a finite field was given by Gyarmati in 2015. In this article we improve the bound given by Gyarmati on family complexity of binary Legendre sequences. The bound depends on the Lambert W function and the number of elements in a finite field belonging to its proper subfield. Moreover, we present a fast method for calculating the bound.