# Quadratic Frobenius probable prime tests costing two selfridges

## TL;DR

This paper introduces efficient deterministic quadratic Frobenius probable prime tests that operate with a runtime comparable to two selfridges, offering a potentially faster method for primality testing of large integers.

## Contribution

It presents a novel deterministic quadratic Frobenius probable prime test with a computational cost of about two selfridges, improving efficiency in primality testing.

## Key findings

- Test runs efficiently on large integers.
- Achieves primality testing with approximately 2 selfridges cost.
- Provides a deterministic alternative to probabilistic tests.

## Abstract

By an elementary observation about the computation of the difference of squares for large in- tegers, deterministic quadratic Frobenius probable prime tests are given with running times of approximately 2 selfridges.