<s>
Shanks	B-Algorithm
's	I-Algorithm
square	I-Algorithm
forms	I-Algorithm
factorization	I-Algorithm
is	O
a	O
method	O
for	O
integer	O
factorization	O
devised	O
by	O
Daniel	O
Shanks	O
as	O
an	O
improvement	O
on	O
Fermat	B-Algorithm
's	I-Algorithm
factorization	I-Algorithm
method	I-Algorithm
.	O
</s>
<s>
The	O
success	O
of	O
Fermat	B-Algorithm
's	I-Algorithm
method	I-Algorithm
depends	O
on	O
finding	O
integers	O
and	O
such	O
that	O
,	O
where	O
is	O
the	O
integer	O
to	O
be	O
factored	O
.	O
</s>
<s>
A	O
practical	O
algorithm	O
for	O
finding	O
pairs	O
which	O
satisfy	O
was	O
developed	O
by	O
Shanks	O
,	O
who	O
named	O
it	O
Square	O
Forms	O
Factorization	O
or	O
SQUFOF	B-Algorithm
.	O
</s>
<s>
Although	O
there	O
are	O
now	O
much	O
more	O
efficient	O
factorization	O
methods	O
available	O
,	O
SQUFOF	B-Algorithm
has	O
the	O
advantage	O
that	O
it	O
is	O
small	O
enough	O
to	O
be	O
implemented	O
on	O
a	O
programmable	O
calculator	O
.	O
</s>
<s>
In	O
1858	O
,	O
the	O
Czech	O
mathematician	O
Václav	O
Šimerka	O
used	O
a	O
method	O
similar	O
to	O
SQUFOF	B-Algorithm
to	O
factor	O
.	O
</s>
<s>
Below	O
is	O
an	O
example	O
of	O
C	O
function	O
for	O
performing	O
SQUFOF	B-Algorithm
factorization	O
on	O
unsigned	O
integer	O
not	O
larger	O
than	O
64	O
bits	O
,	O
without	O
overflow	O
of	O
the	O
transient	O
operations	O
.	O
</s>
