Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Func_ComputeKeysRingRelinFFT problem #3

Open
Jyun-Neng opened this issue Mar 9, 2018 · 2 comments
Open

Func_ComputeKeysRingRelinFFT problem #3

Jyun-Neng opened this issue Mar 9, 2018 · 2 comments

Comments

@Jyun-Neng
Copy link
Contributor

Jyun-Neng commented Mar 9, 2018

At line 424 in ltv.cpp file (src folder), f = ft*p + 1.
Not all coefficients in f are assigned ft[i]*p+1.
In fact, only f[0] is ft[0]*p+1.
Others, for example, f[1] is ft[1]*p.

@yarkindoroz
Copy link
Collaborator

It is the correct use case. The logic is that a key f with property f =2f'+1 is used to extract message after multiplications and mod 2 operation. For instance; f*m = 2f'm + m, if we take mod 2 we have m as result. If all the elements have +1, we will not be able to have m. We will have m distributed to all the slots as m+mx+mx^2+mx^3 ... . This will mess up the computation algorithmically.

@Jyun-Neng
Copy link
Contributor Author

Thank you! I understand!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants