New classes of quadratic bent functions in polynomial forms

This work addresses a specific problem in cryptography and coding theory for researchers in those fields, and it appears incremental as it builds on existing constructions of bent functions.

The paper tackles the problem of constructing quadratic bent functions by proposing a new method using polynomial forms, and it applies the right Euclid algorithm in skew-polynomial rings over finite fields of characteristic 2 to prove the construction.