a key feature of rlwe signature algorithms is the use of a technique known as rejection sampling. in this technique, if the infinity norm of a signature polynomial exceeds a fixed bound, β, that polynomial will be discarded and the signing process will begin again. this process will be repeated until the infinity norm of the signature polynomial is less than or equal to the bound. rejection sampling ensures that the output signature is not exploitably correlated with the signer's secret key values.