Prime Numbers

9.4 Enhancements for gcd and inverse 469
}
q = ⌊u/v⌋;
(u, v) =(v, u mod v);
0 1
A =
A;
1 −q
}
return A;
3. [Set up recursive procedure hgcd to modify global matrix G]
hgcd(b, x, y) { // Variables u, v, q, m, C are local.
if(y == 0) return;
u = ⌊x/2b⌋; v = ⌊y/2b⌋; m = B(u); // B is as usual the bit-length function.
if(m