Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I want to implement the ATV-FHE scheme as it is described here How to generate the public key?

Should I compute it as indicated in section 2 :

$h(i) = 2g(i)*[ ( f(i) )^{(-1)} ]$

or should I sample the public key as indicated in section 3 Parameter selection in NTRU_FHE :

Recall that for the NTRU-FHE scheme, the public key is of the form $h = 2gf^{(-1)}$ where $g$; $f$ chosen from a Gaussian distribution $D$ where $f$ is kept secret. The DSPR problem is to distinguish polynomials of the form $h = 2gf^{(-1)}$ from samples $h_0$ picked uniformly at random from the ring $Rq$. If the DSPR problem is hard, we can replace $h = 2gf^{(-1)}$ by some uniformly sampled $h_0$.

share|improve this question
Thank you very much for editing. Now is much better. – user2991856 Nov 2 '15 at 8:47

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.