bits at a time and need to finish at -1, so -1 + 5 * 51 = 254. index := 254 sel, sign := boothW5(s.Rsh(index)) // sign is always zero because the boothW5 input here is at // most two bits long, so the top bit is never set. _ = sign // Neither Select nor Add have exceptions for the point at infinity / // selector zero, so we don't need to check for it here or in the loop. table := new(p256Table).Compute(q) table.Select(p, sel) t := NewP256Point() for index >= 4 { index -= 5 p.Double(p) p.Double(p) p.Double(p)...

bits at a time and need to finish at -1, so -1 + 5 * 51 = 254. index := 254 sel, sign := boothW5(s.Rsh(index)) // sign is always zero because the boothW5 input here is at // most two bits long, so the top bit is never set. _ = sign // Neither Select nor Add have exceptions for the point at infinity / // selector zero, so we don't need to check for it here or in the loop. table := new(p256Table).Compute(q) table.Select(p, sel) t := NewP256Point() for index >= 4 { index -= 5 p.Double(p) p.Double(p) p.Double(p)...