The Generalized FB-Direct Theorem

OSF Preprints (OSF Preprints) 2026 Preprint

Authors: Ender UYGUN
Cited by: 0

Abstract

While standard methods like Cornacchia’s algorithm rely on probabilistic searches with cubic logarithmic complexity, the Generalized FB-Direct Theorem deterministically recovers the cofactor at the speed of basic multiplication, completely eliminating the need for modular square roots

Fields of Study & Subjects

Cryptography and Residue Arithmetic Analytic Number Theory Research Polynomial and algebraic computation

Publication details

Journal / source
OSF Preprints (OSF Preprints)
Publication date
19 February 2026
Language
EN
Document type
Preprint