# A new method for recognising Suzuki groups

## TL;DR

This paper introduces a novel polynomial-time algorithm, with probabilistic elements, for recognizing Suzuki groups in their natural representations, and provides an implementation in Magma.

## Contribution

It presents the first efficient algorithm for constructive recognition of Suzuki groups, leveraging a discrete logarithm oracle.

## Key findings

- Algorithm runs in Las Vegas polynomial time
- Implementation available in Magma
- Effective recognition of Suzuki groups achieved

## Abstract

We present a new algorithm for constructive recognition of the Suzuki groups in their natural representations. The algorithm runs in Las Vegas polynomial time given a discrete logarithm oracle. An implementation is available in the Magma computer algebra system.