tuxmain/gwrizienn
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Feature-complete for implementing real crypto

Browse source
This commit is contained in:
Pascal Engélibert 2025-08-29 22:58:23 +02:00
commit f34f931030
13 changed files with 2684 additions and 306 deletions
Download patch file Download diff file Expand all files Collapse all files

9
README.md
View file

@ -12,10 +12,17 @@ Goals:
Non-goals:
* Generic (it's generic but only for primitive types)
* Complete (it's simple because it's not a complete implementation of modern algebra)
* Dynamic (vector dimensions and moduli are strongly typed)
Supported:
* ring Zq
* ring Zq/(x^N+1) with additive operations
* ring Zq/(x^N+1) with multiplicative operations if q=p or q=2p with p prime and 2N divides p-1
* vectors and matrices of the above rings
## Name
It's Breton for "root", because we use roots of unity to compute the NTT for faster polynomial multiplication.
Pronounce _grizienn_. It's Breton for "root", because we use roots of unity to compute the NTT for faster O(N log N) polynomial multiplication.
## License