Closed. This question does not meet Stack开发者_高级运维 Overflow guidelines. It is not currently accepting answers.
I\'m implementing the NTRUEncrypt algorithm, according to an NTRU tutorial, a polynomial f has an inverse g such that f*g=1 mod x, basically the polynomial multiplied by its inverse reduced modulo x g
I\'m doing a project where I have to implement the NTRUEncrypt public key cryptosystem. This is th开发者_如何学编程e first step according to their guide in encrypting - \"Alice, who wants to send a se
加载中,请稍侯......