arnaucube/phantom-zone
1
0
Fork 0
mirror of https://github.com/arnaucube/phantom-zone.git synced 2026-01-09 15:41:30 +01:00
Code Issues Projects Releases Wiki Activity

generated some good primes

Browse Source
This commit is contained in:
Janmajaya Mall
2024-06-13 10:31:50 +05:30
parent 41fab75713
commit 2fa7cfc6c2
2 changed files with 34 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/bool/evaluator.rs
View File

@@ -1301,7 +1301,7 @@ mod tests {
use crate::{ use crate::{
bool::{ bool::{
self, CommonReferenceSeededMultiPartyServerKeyShare, PublicKey, self, CommonReferenceSeededMultiPartyServerKeyShare, PublicKey,
SeededMultiPartyServerKey, SeededMultiPartyServerKey, SMALL_MP_BOOL_PARAMS,
}, },
ntt::NttBackendU64, ntt::NttBackendU64,
random::{RandomElementInModulus, DEFAULT_RNG}, random::{RandomElementInModulus, DEFAULT_RNG},
@@ -1665,11 +1665,11 @@ mod tests {
ModularOpsU64<CiphertextModulus<u64>>, ModularOpsU64<CiphertextModulus<u64>>,
ModularOpsU64<CiphertextModulus<u64>>, ModularOpsU64<CiphertextModulus<u64>>,
ShoupServerKeyEvaluationDomain<Vec<Vec<u64>>>, ShoupServerKeyEvaluationDomain<Vec<Vec<u64>>>,
>::new(SP_BOOL_PARAMS); >::new(SMALL_MP_BOOL_PARAMS);
// let (_, collective_pk, _, _, server_key_eval, ideal_client_key) = // let (_, collective_pk, _, _, server_key_eval, ideal_client_key) =
// _multi_party_all_keygen(&bool_evaluator, 20); // _multi_party_all_keygen(&bool_evaluator, 20);
let no_of_parties = 2; let no_of_parties = 16;
let lwe_q = bool_evaluator.pbs_info.parameters.lwe_q(); let lwe_q = bool_evaluator.pbs_info.parameters.lwe_q();
let rlwe_q = bool_evaluator.pbs_info.parameters.rlwe_q(); let rlwe_q = bool_evaluator.pbs_info.parameters.rlwe_q();
let lwe_n = bool_evaluator.pbs_info.parameters.lwe_n().0; let lwe_n = bool_evaluator.pbs_info.parameters.lwe_n().0;

54
src/utils.rs
View File

@@ -262,29 +262,37 @@ where
#[cfg(test)] #[cfg(test)]
mod tests { mod tests {
use super::is_probably_prime;
// #[test] // let n = 1 << (11 + 1);
// fn gg() { // let mut start = 1 << 55;
// let n = 1 << (11 + 1); // while start < (1 << 56) {
// let mut start = 1 << 55; // if start % n == 1 {
// while start < (1 << 56) { // break;
// if start % n == 1 {
// break;
// }
// start += 1;
// } // }
// start += 1;
// let mut prime = None;
// while start < (1 << 56) {
// if is_probably_prime(start) {
// dbg!(start);
// prime = Some(start);
// break;
// }
// dbg!(start);
// start += (n);
// }
// println!("{:?}", prime);
// } // }
// let mut prime = None;
// while start < (1 << 56) {
// if is_probably_prime(start) {
// dbg!(start);
// prime = Some(start);
// break;
// }
// dbg!(start);
// start += (n);
// }
#[test]
fn gg() {
let q = 30;
for i in 0..1000 {
let x = (1u64 << (q * 2)) + (i * (1 << q)) + 1;
let is_prime = is_probably_prime(x);
if is_prime {
println!("{x} = 2^{} + {i} * 2^{q} + 1", 2 * q);
}
}
// println!("{:?}", prime);
}
} }