-
Notifications
You must be signed in to change notification settings - Fork 12
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
AVX2: Simplify non-overflow reasoning in inverse NTT
The AVX2 inverse NTT aggressively minimizes the number of modular reductions required. This is correct to our knowledge, but it is difficult to reason about: As the previous commit shows, one has to take into account rather tight bounds for the absolute value of a Montgomery multiplication. This commit adds another modular reduction to the AVX2 inverse NTT. While not strictly necessary, it simplifies the bounds reasoning considerably, and does not come at a meaningful performance cost. Signed-off-by: Hanno Becker <[email protected]>
- Loading branch information
1 parent
b0a95d1
commit a2bf116
Showing
1 changed file
with
34 additions
and
21 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters