Skip to content

Latest commit

 

History

History
16 lines (12 loc) · 480 Bytes

README.md

File metadata and controls

16 lines (12 loc) · 480 Bytes

RNS Primes

Finding and listing RNS primes for leveled RNS-CKKS.

For given $N$, we say $p$ is an RNS prime if $X^N+1$ splits in $Z_p$. This is equivalent to $p$ is congruent to $1$ modulo $2N$. This script

This code finds RNS primes that are appropriate to be used for RNS-CKKS. It also finds RNS primes for 32-bit RNS-CKKS with higher precision bits than 32.

Compiling

To build my code, call

mkdir obj bin
make

This will build a binary file bin/prime.exe.