most rlwe signature algorithms also require the ability to cryptographically hash arbitrary bit strings into small polynomials according to some distribution. the example below uses a hash function, polyhash(ω), which accepts a bit string, ω, as input and outputs a polynomial with n coefficients such that exactly k of these coefficients have absolute value greater than zero and less than an integer bound b (see above).