diff options
| author | W. Kosior <koszko@koszko.org> | 2025-01-25 19:21:20 +0100 |
|---|---|---|
| committer | W. Kosior <koszko@koszko.org> | 2025-01-25 19:21:20 +0100 |
| commit | ca8a50d2d18109ca416e1518232505e5c23eace7 (patch) | |
| tree | 5a898afc9c8267055f961f0ff12c7805dc586b6a | |
| parent | dc49c13c4fa6a362a42fc9662b153f75b5bae3e8 (diff) | |
| download | pq-blind-sigs-impl-ca8a50d2d18109ca416e1518232505e5c23eace7.tar.gz pq-blind-sigs-impl-ca8a50d2d18109ca416e1518232505e5c23eace7.zip | |
Remove old `Building' README section.magister
| -rw-r--r-- | README.md | 11 |
1 files changed, 4 insertions, 7 deletions
@@ -10,7 +10,10 @@ multiplication). Also, there are possibly better BS algorithms by now. ## How to build it First, make sure make and GCC, as well as the libraries FLINT and Libgcrypt are -installed. Then, make use of the included `Makefile`. +installed. You can get the dependencies with the help of GNU Guix, using +`dev-shell` script that you can find in the project's root. + +Then, make use of the included `Makefile`. ``` make @@ -182,11 +185,5 @@ Sum of polynomials in the ring: Interestingly, only modulo operations in the latter range seem to be directly supported in FLINT as of today. -## Building - -You can install the dependencies with GNU Guix using `dev-shell` script that you -can find in project's root. For the rest, please consult the included Makefile -:) - - [1] https://eprint.iacr.org/2008/322 - [2] https://flintlib.org/ |