pub struct PackedGenericInt<const N: usize, T, U>{ /* private fields */ }Expand description
A generic integer in the packed form with a constant size generic parameter, similar to PackedDynamicGenericInt
and uses it as the internal representation.
§Example
use std::sync::Arc;
use parasol_runtime::{
CircuitProcessor, ComputeKey, SecretKey, PublicKey, Evaluation, Encryption,
L1GlweCiphertext, fluent::{FheCircuitCtx,
PackedGenericInt, Unsigned}
};
let enc = Encryption::default();
let sk = SecretKey::generate_with_default_params();
let pk = PublicKey::generate_with_default_params(&sk);
let ck = ComputeKey::generate_with_default_params(&sk);
let eval = Evaluation::with_default_params(Arc::new(ck));
let (mut uproc, fc) = CircuitProcessor::new(16_384, None, &eval, &enc);
let val = PackedGenericInt::<16, L1GlweCiphertext, Unsigned>::encrypt(42, &enc, &pk);
let ctx = FheCircuitCtx::new();
let as_unpacked = val
.graph_input(&ctx)
.unpack(&ctx)
.collect_outputs(&ctx, &enc);
uproc
.run_graph_blocking(&ctx.circuit.borrow(), &fc);
assert_eq!(as_unpacked.decrypt(&enc, &sk), 42);Implementations§
Source§impl<const N: usize, T, U> PackedGenericInt<N, T, U>
impl<const N: usize, T, U> PackedGenericInt<N, T, U>
Sourcepub fn encrypt(val: U::PlaintextType, enc: &Encryption, pk: &PublicKey) -> Self
pub fn encrypt(val: U::PlaintextType, enc: &Encryption, pk: &PublicKey) -> Self
Encrypt the given integer
Sourcepub fn trivial_encrypt(val: U::PlaintextType, enc: &Encryption) -> Self
pub fn trivial_encrypt(val: U::PlaintextType, enc: &Encryption) -> Self
Trivially encrypt the given integer
Sourcepub fn decrypt(&self, enc: &Encryption, sk: &SecretKey) -> U::PlaintextType
pub fn decrypt(&self, enc: &Encryption, sk: &SecretKey) -> U::PlaintextType
Decrypts the given integer.
Methods from Deref<Target = PackedDynamicGenericInt<T, U>>§
Sourcepub fn decrypt(&self, enc: &Encryption, sk: &SecretKey) -> U::PlaintextType
pub fn decrypt(&self, enc: &Encryption, sk: &SecretKey) -> U::PlaintextType
Decrypt this packed encrypted dynamic generic integer.
Sourcepub fn graph_input(
&self,
ctx: &FheCircuitCtx,
) -> PackedDynamicGenericIntGraphNode<T, U>
pub fn graph_input( &self, ctx: &FheCircuitCtx, ) -> PackedDynamicGenericIntGraphNode<T, U>
Create an input node in the FheCircuitCtx graph.
Trait Implementations§
Source§impl<const N: usize, T, U> Clone for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> Clone for PackedGenericInt<N, T, U>
Source§fn clone(&self) -> PackedGenericInt<N, T, U>
fn clone(&self) -> PackedGenericInt<N, T, U>
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<const N: usize, T, U> Deref for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> Deref for PackedGenericInt<N, T, U>
Source§impl<'de, const N: usize, T, U> Deserialize<'de> for PackedGenericInt<N, T, U>
impl<'de, const N: usize, T, U> Deserialize<'de> for PackedGenericInt<N, T, U>
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<const N: usize, T, U> From<PackedDynamicGenericInt<T, U>> for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> From<PackedDynamicGenericInt<T, U>> for PackedGenericInt<N, T, U>
Source§fn from(value: PackedDynamicGenericInt<T, U>) -> Self
fn from(value: PackedDynamicGenericInt<T, U>) -> Self
Converts to this type from the input type.
Source§impl<const N: usize, T, U> From<PackedGenericInt<N, T, U>> for PackedDynamicGenericInt<T, U>
impl<const N: usize, T, U> From<PackedGenericInt<N, T, U>> for PackedDynamicGenericInt<T, U>
Source§fn from(value: PackedGenericInt<N, T, U>) -> PackedDynamicGenericInt<T, U>
fn from(value: PackedGenericInt<N, T, U>) -> PackedDynamicGenericInt<T, U>
Converts to this type from the input type.
Source§impl<const N: usize, T: CiphertextOps + PolynomialCiphertextOps, U: Sign> GetSize for PackedGenericInt<N, T, U>
impl<const N: usize, T: CiphertextOps + PolynomialCiphertextOps, U: Sign> GetSize for PackedGenericInt<N, T, U>
Source§impl<const N: usize, T, U> Serialize for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> Serialize for PackedGenericInt<N, T, U>
Auto Trait Implementations§
impl<const N: usize, T, U> Freeze for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> !RefUnwindSafe for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> Send for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> Sync for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> Unpin for PackedGenericInt<N, T, U>where
U: Unpin,
impl<const N: usize, T, U> UnsafeUnpin for PackedGenericInt<N, T, U>
impl<const N: usize, T, U> !UnwindSafe for PackedGenericInt<N, T, U>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.