So the way we sign a message 'M' is basically by simply evaluating the function at the point 'M' So the tag for the message M is simply the value of the function at the point M and then the way we verify a message to that pair is by recomputing the value of the function at the message M and checking whether that is equal to the tag given to us. 