(bits+7)/8) for { if err := drbg.ReadWithReader(rand, b); err != nil { return nil, err } if excess := len(b)*8 - bits; excess != 0 { b[0] >>= excess } // Don't let the value be too small: set the most significant two bits. // Setting the top two bits, rather than just the top bit, means that // when two of these values are multiplied together, the result isn't // ever one bit short. if excess := len(b)*8 - bits; excess < 7 { b[0] |= 0b1100_0000 >> excess } else { b[0] |= 0b0000_0001 b[1] |= 0b1000_0000...

easier to inject test // candidates, which can be represented as simple big-endian integers. excess := len(b)*8 - bits b[0] &= 0b1111_1111 >> excess // Don't let the value be too small: set the most significant two bits. // Setting the top two bits, rather than just the top bit, means that // when two of these values are multiplied together, the result isn't // ever one bit short. if excess < 7 { b[0] |= 0b1100_0000 >> excess } else { b[0] |= 0b0000_0001 b[1] |= 0b1000_0000 } // Make the value odd since...