Bob's the RSA system uses the parameters $n=91,e=5,d=29($so his public key $(n,e)=(91,5)$ and a modified Jenkins hash function $[$wikipedia$]$ given below.

Bob does digital signature signing for a given message msg to obtain its signature

$s.$ Then he sends Alice $(msg,s).$ Alice knows Bob's public key and the modified Jenkins function, once she receives Bob's $(msg,s),$ she performs digital signature verifying.

unsigned int jenkins$($char$*msg,$ size$\_$t len$)$

size$\_$t $i=0$

unsigned int hash $=0$;

while

hash $+=msg[i++]$

hash $+=$ hash $<mn\; id="EditorElement\_32477">1</mn><mn\; id="EditorElement\_32478">0</mn>$;

hash ${?}^{?}=$ hash $\{$:$>6$;$\}$

hash $+=$ hash ;

hash ${?}^{?}=$ hash $>11$;

hash $+=$ hash $15$;

return hash;