How to make a message into a polynomial on NTRU encryption? How to make a message into a polynomial on NTRU encryption? for example how we can conver 'hello world' to polynomial...
i have read the converting operation on IEEE Std 1363.1- 2008, but i can't understand the process without example, can anyone show for the small example?
According to Wikipedia:  


  Alice, who wants to send a secret message to Bob, puts her message in the form of a polynomial m with coefficients {-1,0,1}. In modern applications of the encryption, the message polynomial can be translated in a binary or ternary representation.


So, lets say you have a message encoded in base 2 as 101101, you'd set the polynomial to $1+0x+1x^2+1x^3+0x^4+1x^5=1+x^2+x^3+x^5$. That then is your message to encrypt. Technically you could encode a message in ternary and do the same thing. Then you'd have coefficients in $\{-1,0,1\}$. There is no reduction in security by encoding in binary, however, and only having coefficients in $\{0,1\}$.

Now, moving that to your string. First encode your string in base 2 (you can do this how you want), then construct your polynomial. If you have more bits than the degree of the NTRU polynomial, you'll have to split up the message into blocks. I'm sure you know about the standard warnings with using public key encryption for large messages. Unless you have a really, really good reason you shouldn't do it. Encrypt a random key with the public key cipher and encrypt the plaintext with the random key.