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.

Sign up for GitHub

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

Jump to bottom

Implement FFT polynomial multiplication #4

Closed
10d9e opened this issue Aug 26, 2021 · 2 comments
Closed

Implement FFT polynomial multiplication #4

10d9e opened this issue Aug 26, 2021 · 2 comments

Comments

@10d9e
Copy link
Contributor

10d9e commented Aug 26, 2021

Currently only the naive and karatsuba polynomial multiplication algorithms exist to find the product of Int and Torus polynomials. In order to speed things up, a snappier FFT variation is required as in the original c library. ( see any of the fft processors here: https://github.com/tfhe/tfhe/tree/master/src/libtfhe/fft_processors )

A test, that currently fails, has been implemented to expose the issue:

https://github.com/TheDonutFactory/go-tfhe/blob/master/lagrangehalfc_test.go#L152
@10d9e
Copy link
Contributor Author

10d9e commented Dec 18, 2021

PR: #6

@10d9e 10d9e closed this as completed Dec 18, 2021
@10d9e
Copy link
Contributor Author

10d9e commented Dec 18, 2021

Initial FFT has been implemented and improves bootstrap performance significantly

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@10d9e