mapping point on elliptic curve good evening guys,  let us suppose that elliptic curve is given by the following equation

$y^2=x^3-x+1  \pmod {127}$
on the following table  message  $9$ is converted   to the point on curve



if i insert directly   into equation , we  will get

$9^3-9+1=721$ and  $721$ mod  $127$ gives me 86, so how 91  is  given? what is relation between  $91$ and  $9$ ? please help me
After having read the "paper", which is probably just a "publication" the relevant student had to tick off, I'm pretty sure that a standard probabilistic encoding of messages to curve points was used, which is usually attributed to Koblitz. Written algorithmically:


Pick a message $m$ of 1 decimal digit length.
Set $i\gets 0$
Construct $x=m\cdot 10+i$. If $i\geq 10$ return with an error, this has probability around $2^{-10}$.
Compute $y=\sqrt{x^3+ax+b}\bmod p$ where $\sqrt\cdot$ is a modular square root, ie $(\sqrt x\cdot \sqrt x)\bmod p=x$. If no such $y$ exists, set $i\gets i+1$ and go to 3.
return $(x,y)$


Decoding a curve point can then be achieved by finding the decimal representation and cutting the last digit off.