Scott Fluhrer edited untitled.tex  over 8 years ago

Commit id: cb5cb98c21c6f99d41e7dfb23977e9100046d66b

deletions | additions      

       

There are a number of proposed key agreement protocols based on Ring-LWE, including \cite{Ding_2012}, \cite{Peikert_2014}, \cite{Alkim_2015}, \cite{Singh_2015}  ... While these protocols differ in the details, they all follow the same basic paradigm.  There are a number of parameter sets defined for NTRU; each parameter set includes the value of $N$ that are used during the NTRU operations, the values of $p$ and $q$, as well as the expected security level for this parameter set (that is, the value $k$ for which we expect any attack against this parameter set to take at least $O(2^k)$ operations. ...  NTRUEncrypt is available as a free-for-noncommercial use library from \href{http://www.securityinnovation.com}{Security Innovation}; we will be analyzing the parameter sets and the key generation and padding methods as implemented by that library.  When we select a private key for NTRUEncrypt, we select two polynomials $F$ and $G$ with specific sets of coefficients; we also need to make sure that $F$ is invertible. Once we have that, we can compute the public polynomial $H = F^{-1}G$. The public key decryption process uses the secret polynomial $F$ to decrypt.