Q is a large strong prime and g is a generator of the domain ZQ. The user system generates n and s in the same way as before, except that n <Q instead of n<N. The construction of P is the same as before, except that we do not use RSA to encrypt ri,1 and ri,2.