1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668
//! Module containing the definition of the GgswCiphertext.
use crate::core_crypto::commons::parameters::*;
use crate::core_crypto::commons::traits::*;
use crate::core_crypto::entities::*;
/// A [`GGSW Ciphertext`](`GgswCiphertext`).
///
/// # Formal Definition
///
/// # GGSW Ciphertext
///
/// A GGSW ciphertext is an encryption of a polynomial plaintext.
/// It is a vector of [`GLWE ciphertexts`](`crate::core_crypto::entities::GlweCiphertext`).
/// It is a generalization of both GSW ciphertexts and RGSW ciphertexts.
///
/// We call $q$ the ciphertext modulus.
/// We use the notation $\mathcal{R}\_q$ for the following cyclotomic ring:
/// $\mathbb{Z}\_q\[X\]/\left\langle X^N + 1\right\rangle$ where $N\in\mathbb{N}$ is a
/// power of two.
///
/// We indicate a GGSW ciphertext of a polynomial plaintext $\mathsf{PT} \in\mathcal{R}\_q$
/// as the following vector:
///
/// $$\overline{\overline{\mathsf{CT}}} = \left( \overline{\mathsf{CT}\_0}, \cdots
/// , \overline{\mathsf{CT}\_{k}} \right) \in \mathsf{GGSW}\_{\vec{S}}^{\beta,
/// \ell}\left(\mathsf{PT}\right) \subseteq \mathcal{R}\_q^{(k+1)\times\ell\cdot(k+1)}$$
///
/// Where $\vec{S}=\left(S\_0, \cdots , S\_{k-1}\right)\in \mathcal{R}\_q^k$ and for all $0\le i<k$
/// we have $\overline{\mathsf{CT}\_i} \in \mathsf{GLev}\_{\vec{S}}^{\beta, \ell}\left( -S\_i \cdot
/// \mathsf{PT}\right)\subseteq \mathcal{R}\_q^{\ell \cdot (k+1)}$ and $\overline{\mathsf{CT}\_k}
/// \in \mathsf{GLev}\_{\vec{S}}^{\beta, \ell}\left( \mathsf{PT}\right)\subseteq
/// \mathcal{R}\_q^{\ell \cdot (k+1)}$.
///
/// This type of ciphertext contains a lot of redundancy ($k+1$ GLev ciphertexts -- definition
/// below -- each encrypting the same plaintext times an element of the secret key) .
///
/// ## Levels and decomposition base
/// A GGSW ciphertext contains GLev ciphertexts that are parametrized with an
/// integer $\ell$ called level and an integer $\beta$ (generally a power of 2) called
/// decomposition base.
///
/// ## Secret Key
/// A GGSW ciphertext is encrypted under a
/// [`GLWE secret key`](`crate::core_crypto::entities::GlweSecretKey`).
///
/// ## GGSW Encryption
/// ###### inputs:
/// - $\mathsf{PT}\in\mathcal{R}\_q$: a polynomial plaintext
/// - $\vec{S}=\left(S\_0, \cdots, S\_{k-1} \right) \in\mathcal{R}\_q^k$: a
/// [`GLWE secret key`](`crate::core_crypto::entities::GlweSecretKey`)
/// - $\mathcal{D\_{\sigma^2,\mu}}$: a normal distribution of variance $\sigma^2$ and a mean of
/// $\mu$
/// - $\ell$: number of levels desired
/// - $\beta$: decomposition base
///
/// ###### outputs:
/// - $\overline{\overline{\mathsf{CT}}} = \left( \overline{\mathsf{CT}\_0}, \cdots ,
/// \overline{\mathsf{CT}\_{k-1}} \right) \in \mathsf{GGSW}\_{\vec{S}}^{\beta,
/// \ell}\left(\mathsf{PT}\right) \subseteq \mathcal{R}\_q^{(k+1)\cdot\ell\cdot(k+1)}$: a GGSW
/// ciphertext
///
/// ###### algorithm:
/// 1. for $0\le i < k$:
/// - compute $\mathsf{PT}\_i = -S\_i\cdot\mathsf{PT} \in \mathbb{Z}\_q$
/// - compute $\overline{\mathsf{CT}\_i} \leftarrow \mathsf{GLev}.\mathsf{encrypt}\left(
/// \mathsf{PT}\_i, \vec{S} ,\mathcal{D\_{\sigma^2,\mu}} ,\ell \right)$
/// 2. compute $\overline{\mathsf{CT}\_n} \leftarrow \mathsf{GLev}.\mathsf{encrypt}\left(
/// \mathsf{PT}, \vec{s} ,\mathcal{D\_{\sigma^2,\mu}} ,\ell \right)$
/// 3. output $\overline{\overline{\mathsf{CT}}} = \left( \overline{\mathsf{CT}\_0} , \cdots ,
/// \overline{\mathsf{CT}\_{n}} \right)$
///
/// ###### equivalent algorithm (using the gadget matrix):
/// 1. for $0\le i \le k$:
/// - for $0\le j < \ell$:
/// - compute $\mathsf{CT}\_{i,j} \leftarrow \mathsf{GLWE}.\mathsf{encrypt}\left( 0, \vec{S}
/// ,\mathcal{D\_{\sigma^2,\mu}} \right)$
/// - add to the $i$-th component of $\mathsf{CT}\_{i,j}$ the value
/// $\left\lfloor\mathsf{PT}\cdot
/// \frac{q}{\beta^{j+1}} \right\rceil \in \mathcal{R}\_q$
/// - set $\overline{\mathsf{CT}\_i} = \left( \mathsf{CT}\_{i,0} , \cdots ,
/// \mathsf{CT}\_{i,\ell-1}
/// \right)$
/// 2. output $\overline{\overline{\mathsf{CT}}} = \left( \overline{\mathsf{CT}\_0} , \cdots ,
/// \overline{\mathsf{CT}\_{n}} \right)$
///
/// ## GGSW Decryption
/// Simply use the GLev decryption algorithm on the last GLev ciphertext contained in the GGSW
/// ciphertext.
///
/// # GLev Ciphertext
///
/// **Remark:** This type of ciphertexts is not yet directly exposed in the library but its
/// description helps understanding GGSW ciphertext.
///
/// A GLev ciphertext is an encryption of a polynomial plaintext.
/// It is a vector of GLev ciphertexts.
/// It is a generalization of both Lev ciphertexts and RLev ciphertexts.
///
/// We call $q$ the ciphertext modulus.
/// We use the notation $\mathcal{R}\_q$ for the following cyclotomic ring:
/// $\mathbb{Z}\_q\[X\]/\left\langle X^N + 1\right\rangle$ where $N\in\mathbb{N}$ is a power of two.
///
/// We indicate a GLev ciphertext of a polynomial plaintext $\mathsf{PT} \in\mathcal{R}\_q^{k+1}$ as
/// the following vector: $$\overline{\mathsf{CT}} = \left( \mathsf{CT}\_0 , \cdots ,
/// \mathsf{CT}\_{\ell-1} \right) \in \mathsf{GLev}\_{\vec{S}}^{\beta, \ell}\left(\mathsf{PT}\right)
/// \subseteq \mathcal{R}\_q^{(k+1)\cdot \ell}$$
///
/// Where $k=|\vec{S}|$ and for all $0\le i <\ell$, we have $\mathsf{CT}\_i \in
/// \mathsf{GLWE}\_{\vec{S}}\left( \left\lfloor\mathsf{PT}\cdot \frac{q}{\beta^{i+1}} \right\rceil
/// \right)\subseteq \mathcal{R}\_q^{k+1}$ (we are using the encoding in the MSB with $\Delta =
/// \frac{q}{\beta^{i+1}}$).
///
/// This type of ciphertext contains redundancy ($\ell$
/// [`GLWE ciphertext`](`crate::core_crypto::entities::GlweCiphertext`),
/// each encrypting the same plaintext times a different scaling factor).
///
/// ## Decomposition base
/// A GLev ciphertext is parametrized with a decomposition base $\beta$, generally chosen as a power
/// of 2.
///
/// ## Levels
/// A GLev ciphertext contains a number of levels $\ell$ from level $0$ to level $\ell-1$.
///
/// ## Secret Key
/// A GLev ciphertext is encrypted under a
/// [`GLWE secret key`](`crate::core_crypto::entities::GlweSecretKey`).
///
/// ## GLev Encryption
/// ###### inputs:
/// - $\mathsf{PT}\in \mathcal{R}\_q$: a polynomial plaintext
/// - $\vec{S}\in \mathcal{R}\_q^k$: a
/// [`GLWE Secret Key`](`crate::core_crypto::entities::GlweSecretKey`)
/// - $\mathcal{D\_{\sigma^2,\mu}}$: a normal distribution of variance $\sigma^2$ and a mean of
/// $\mu$
/// - $\ell$: number of levels desired
/// - $\beta$: decomposition base
///
/// ###### outputs:
/// - $\overline{\mathsf{CT}} = \left( \mathsf{CT}\_0 , \cdots , \mathsf{CT}\_{\ell-1} \right) \in
/// \mathsf{GLev}\_{\vec{S}}^{\beta, \ell}\left(\mathsf{PT}\right) \subseteq
/// \mathcal{R}\_q^{(k+1)\cdot\ell}$: a GLev ciphertext
///
/// ###### algorithm:
/// 1. for $0\le i < \ell-1$:
/// - compute $\mathsf{PT}\_i = \left\lfloor\mathsf{PT}\cdot \frac{q}{\beta^{i+1}} \right\rceil
/// \in
/// \mathcal{R}\_q$
/// - compute $\mathsf{CT}\_i \leftarrow \mathsf{GLWE}.\mathsf{encrypt}\left( \mathsf{PT}\_i,
/// \vec{S} ,\mathcal{D\_{\sigma^2,\mu}} \right)$
/// 2. output $\overline{\mathsf{CT}} = \left( \mathsf{CT}\_0 , \cdots , \mathsf{CT}\_{\ell-1}
/// \right)$
///
/// ## GLev Decryption
/// Simply use the
/// [`GLWE decryption
/// algorithm`](`crate::core_crypto::algorithms::glwe_encryption::decrypt_glwe_ciphertext`)
/// on one of the GLWE ciphertexts contained in the GLev ciphertext.
#[derive(Clone, Debug, PartialEq, Eq, serde::Serialize, serde::Deserialize)]
pub struct GgswCiphertext<C: Container>
where
C::Element: UnsignedInteger,
{
data: C,
glwe_size: GlweSize,
polynomial_size: PolynomialSize,
decomp_base_log: DecompositionBaseLog,
ciphertext_modulus: CiphertextModulus<C::Element>,
}
impl<T: UnsignedInteger, C: Container<Element = T>> AsRef<[T]> for GgswCiphertext<C> {
fn as_ref(&self) -> &[T] {
self.data.as_ref()
}
}
impl<T: UnsignedInteger, C: ContainerMut<Element = T>> AsMut<[T]> for GgswCiphertext<C> {
fn as_mut(&mut self) -> &mut [T] {
self.data.as_mut()
}
}
/// Return the number of elements in a [`GgswCiphertext`] given a [`GlweSize`], [`PolynomialSize`]
/// and [`DecompositionLevelCount`].
pub fn ggsw_ciphertext_size(
glwe_size: GlweSize,
polynomial_size: PolynomialSize,
decomp_level_count: DecompositionLevelCount,
) -> usize {
decomp_level_count.0 * ggsw_level_matrix_size(glwe_size, polynomial_size)
}
/// Return the number of elements in a [`GgswLevelMatrix`] given a [`GlweSize`] and
/// [`PolynomialSize`].
pub fn ggsw_level_matrix_size(glwe_size: GlweSize, polynomial_size: PolynomialSize) -> usize {
glwe_size.0 * glwe_size.0 * polynomial_size.0
}
/// Return the number of elements in a [`FourierGgswCiphertext`] given a [`GlweSize`],
/// [`FourierPolynomialSize`] and [`DecompositionLevelCount`].
pub fn fourier_ggsw_ciphertext_size(
glwe_size: GlweSize,
fourier_polynomial_size: FourierPolynomialSize,
decomp_level_count: DecompositionLevelCount,
) -> usize {
decomp_level_count.0 * fourier_ggsw_level_matrix_size(glwe_size, fourier_polynomial_size)
}
/// Return the number of elements in a [`FourierGgswLevelMatrix`] given a [`GlweSize`] and
/// [`FourierPolynomialSize`].
pub fn fourier_ggsw_level_matrix_size(
glwe_size: GlweSize,
fourier_polynomial_size: FourierPolynomialSize,
) -> usize {
glwe_size.0 * glwe_size.0 * fourier_polynomial_size.0
}
impl<Scalar: UnsignedInteger, C: Container<Element = Scalar>> GgswCiphertext<C> {
/// Create a [`GgswCiphertext`] from an existing container.
///
/// # Note
///
/// This function only wraps a container in the appropriate type. If you want to encrypt data
/// you need to use [`crate::core_crypto::algorithms::encrypt_constant_ggsw_ciphertext`] or its
/// parallel counterpart
/// [`crate::core_crypto::algorithms::par_encrypt_constant_ggsw_ciphertext`] using
/// this ciphertext as output.
///
/// This docstring exhibits [`GgswCiphertext`] primitives usage.
///
/// ```
/// use tfhe::core_crypto::prelude::*;
///
/// // DISCLAIMER: these toy example parameters are not guaranteed to be secure or yield correct
/// // computations
/// // Define parameters for GgswCiphertext creation
/// let glwe_size = GlweSize(2);
/// let polynomial_size = PolynomialSize(1024);
/// let decomp_base_log = DecompositionBaseLog(8);
/// let decomp_level_count = DecompositionLevelCount(3);
/// let ciphertext_modulus = CiphertextModulus::new_native();
///
/// // Create a new GgswCiphertext
/// let ggsw = GgswCiphertext::new(
/// 0u64,
/// glwe_size,
/// polynomial_size,
/// decomp_base_log,
/// decomp_level_count,
/// ciphertext_modulus,
/// );
///
/// assert_eq!(ggsw.glwe_size(), glwe_size);
/// assert_eq!(ggsw.polynomial_size(), polynomial_size);
/// assert_eq!(ggsw.decomposition_base_log(), decomp_base_log);
/// assert_eq!(ggsw.decomposition_level_count(), decomp_level_count);
/// assert_eq!(ggsw.ciphertext_modulus(), ciphertext_modulus);
/// assert_eq!(
/// ggsw.ggsw_level_matrix_size(),
/// ggsw_level_matrix_size(glwe_size, polynomial_size)
/// );
///
/// // Demonstrate how to recover the allocated container
/// let underlying_container: Vec<u64> = ggsw.into_container();
///
/// // Recreate a ciphertext using from_container
/// let ggsw = GgswCiphertext::from_container(
/// underlying_container,
/// glwe_size,
/// polynomial_size,
/// decomp_base_log,
/// ciphertext_modulus,
/// );
///
/// assert_eq!(ggsw.glwe_size(), glwe_size);
/// assert_eq!(ggsw.polynomial_size(), polynomial_size);
/// assert_eq!(ggsw.decomposition_base_log(), decomp_base_log);
/// assert_eq!(ggsw.decomposition_level_count(), decomp_level_count);
/// assert_eq!(ggsw.ciphertext_modulus(), ciphertext_modulus);
/// assert_eq!(
/// ggsw.ggsw_level_matrix_size(),
/// ggsw_level_matrix_size(glwe_size, polynomial_size)
/// );
/// ```
pub fn from_container(
container: C,
glwe_size: GlweSize,
polynomial_size: PolynomialSize,
decomp_base_log: DecompositionBaseLog,
ciphertext_modulus: CiphertextModulus<C::Element>,
) -> Self {
assert!(
container.container_len() > 0,
"Got an empty container to create a GgswCiphertext"
);
assert!(
container.container_len() % (glwe_size.0 * glwe_size.0 * polynomial_size.0) == 0,
"The provided container length is not valid. \
It needs to be dividable by glwe_size * glwe_size * polynomial_size: {}. \
Got container length: {} and glwe_size: {glwe_size:?}, \
polynomial_size: {polynomial_size:?}.",
glwe_size.0 * glwe_size.0 * polynomial_size.0,
container.container_len()
);
GgswCiphertext {
data: container,
glwe_size,
polynomial_size,
decomp_base_log,
ciphertext_modulus,
}
}
/// Return the [`PolynomialSize`] of the [`GgswCiphertext`].
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn polynomial_size(&self) -> PolynomialSize {
self.polynomial_size
}
/// Return the [`GlweSize`] of the [`GgswCiphertext`].
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn glwe_size(&self) -> GlweSize {
self.glwe_size
}
/// Return the [`DecompositionBaseLog`] of the [`GgswCiphertext`].
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn decomposition_base_log(&self) -> DecompositionBaseLog {
self.decomp_base_log
}
/// Return the [`DecompositionLevelCount`] of the [`GgswCiphertext`].
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn decomposition_level_count(&self) -> DecompositionLevelCount {
DecompositionLevelCount(self.data.container_len() / self.ggsw_level_matrix_size())
}
/// Return the [`CiphertextModulus`] of the [`GgswCiphertext`].
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn ciphertext_modulus(&self) -> CiphertextModulus<C::Element> {
self.ciphertext_modulus
}
/// Return the size in number of elements of a single [`GgswLevelMatrix`] of the current
/// [`GgswCiphertext`].
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn ggsw_level_matrix_size(&self) -> usize {
// GlweSize GlweCiphertext(glwe_size, polynomial_size) per level
ggsw_level_matrix_size(self.glwe_size, self.polynomial_size)
}
/// Interpret the [`GgswCiphertext`] as a [`PolynomialList`].
pub fn as_polynomial_list(&self) -> PolynomialListView<'_, Scalar> {
PolynomialListView::from_container(self.as_ref(), self.polynomial_size)
}
/// Interpret the [`GgswCiphertext`] as a [`GlweCiphertextList`].
pub fn as_glwe_list(&self) -> GlweCiphertextListView<'_, Scalar> {
GlweCiphertextListView::from_container(
self.as_ref(),
self.glwe_size,
self.polynomial_size,
self.ciphertext_modulus,
)
}
/// Return a view of the [`GgswCiphertext`]. This is useful if an algorithm takes a view by
/// value.
pub fn as_view(&self) -> GgswCiphertextView<'_, Scalar> {
GgswCiphertextView::from_container(
self.as_ref(),
self.glwe_size(),
self.polynomial_size(),
self.decomposition_base_log(),
self.ciphertext_modulus(),
)
}
/// Consume the entity and return its underlying container.
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn into_container(self) -> C {
self.data
}
}
impl<Scalar: UnsignedInteger, C: ContainerMut<Element = Scalar>> GgswCiphertext<C> {
/// Mutable variant of [`GgswCiphertext::as_polynomial_list`].
pub fn as_mut_polynomial_list(&mut self) -> PolynomialListMutView<'_, Scalar> {
let polynomial_size = self.polynomial_size;
PolynomialListMutView::from_container(self.as_mut(), polynomial_size)
}
/// Mutable variant of [`GgswCiphertext::as_glwe_list`].
pub fn as_mut_glwe_list(&mut self) -> GlweCiphertextListMutView<'_, Scalar> {
let polynomial_size = self.polynomial_size;
let glwe_size = self.glwe_size;
let ciphertext_modulus = self.ciphertext_modulus;
GlweCiphertextListMutView::from_container(
self.as_mut(),
glwe_size,
polynomial_size,
ciphertext_modulus,
)
}
/// Mutable variant of [`GgswCiphertext::as_view`].
pub fn as_mut_view(&mut self) -> GgswCiphertextMutView<'_, Scalar> {
let glwe_size = self.glwe_size();
let polynomial_size = self.polynomial_size();
let decomp_base_log = self.decomposition_base_log();
let ciphertext_modulus = self.ciphertext_modulus;
GgswCiphertextMutView::from_container(
self.as_mut(),
glwe_size,
polynomial_size,
decomp_base_log,
ciphertext_modulus,
)
}
}
/// A [`GgswCiphertext`] owning the memory for its own storage.
pub type GgswCiphertextOwned<Scalar> = GgswCiphertext<Vec<Scalar>>;
/// A [`GgswCiphertext`] immutably borrowing memory for its own storage.
pub type GgswCiphertextView<'data, Scalar> = GgswCiphertext<&'data [Scalar]>;
/// A [`GgswCiphertext`] immutably borrowing memory for its own storage.
pub type GgswCiphertextMutView<'data, Scalar> = GgswCiphertext<&'data mut [Scalar]>;
impl<Scalar: UnsignedInteger> GgswCiphertextOwned<Scalar> {
/// Allocate memory and create a new owned [`GgswCiphertext`].
///
/// # Note
///
/// This function allocates a vector of the appropriate size and wraps it in the appropriate
/// type. If you want to encrypt data you need to use
/// [`crate::core_crypto::algorithms::encrypt_constant_ggsw_ciphertext`] or its parallel
/// counterpart [`crate::core_crypto::algorithms::par_encrypt_constant_ggsw_ciphertext`]
/// using this ciphertext as output.
///
/// See [`GgswCiphertext::from_container`] for usage.
pub fn new(
fill_with: Scalar,
glwe_size: GlweSize,
polynomial_size: PolynomialSize,
decomp_base_log: DecompositionBaseLog,
decomp_level_count: DecompositionLevelCount,
ciphertext_modulus: CiphertextModulus<Scalar>,
) -> GgswCiphertextOwned<Scalar> {
GgswCiphertextOwned::from_container(
vec![fill_with; ggsw_ciphertext_size(glwe_size, polynomial_size, decomp_level_count)],
glwe_size,
polynomial_size,
decomp_base_log,
ciphertext_modulus,
)
}
}
/// Metadata used in the [`CreateFrom`] implementation to create [`GgswCiphertext`] entities.
#[derive(Clone, Copy)]
pub struct GgswCiphertextCreationMetadata<Scalar: UnsignedInteger>(
pub GlweSize,
pub PolynomialSize,
pub DecompositionBaseLog,
pub CiphertextModulus<Scalar>,
);
impl<Scalar: UnsignedInteger, C: Container<Element = Scalar>> CreateFrom<C> for GgswCiphertext<C> {
type Metadata = GgswCiphertextCreationMetadata<Scalar>;
#[inline]
fn create_from(from: C, meta: Self::Metadata) -> GgswCiphertext<C> {
let GgswCiphertextCreationMetadata(
glwe_size,
polynomial_size,
decomp_base_log,
ciphertext_modulus,
) = meta;
GgswCiphertext::from_container(
from,
glwe_size,
polynomial_size,
decomp_base_log,
ciphertext_modulus,
)
}
}
/// A convenience structure to more easily write iterators on a [`GgswCiphertext`] levels.
pub struct GgswLevelMatrix<C: Container>
where
C::Element: UnsignedInteger,
{
data: C,
glwe_size: GlweSize,
polynomial_size: PolynomialSize,
ciphertext_modulus: CiphertextModulus<C::Element>,
}
impl<Scalar: UnsignedInteger, C: Container<Element = Scalar>> GgswLevelMatrix<C> {
/// Create a [`GgswLevelMatrix`] from an existing container.
///
/// # Note
///
/// This docstring exhibits [`GgswLevelMatrix`] primitives usage.
///
/// ```
/// use tfhe::core_crypto::prelude::*;
///
/// // DISCLAIMER: these toy example parameters are not guaranteed to be secure or yield correct
/// // computations
/// // Define parameters for GgswLevelMatrix creation
/// let glwe_size = GlweSize(2);
/// let polynomial_size = PolynomialSize(1024);
/// let ciphertext_modulus = CiphertextModulus::new_native();
///
/// let container = vec![0u64; ggsw_level_matrix_size(glwe_size, polynomial_size)];
///
/// // Create a new GgswLevelMatrix
/// let ggsw_level_matrix =
/// GgswLevelMatrix::from_container(container, glwe_size, polynomial_size, ciphertext_modulus);
///
/// assert_eq!(ggsw_level_matrix.glwe_size(), glwe_size);
/// assert_eq!(ggsw_level_matrix.polynomial_size(), polynomial_size);
/// assert_eq!(ggsw_level_matrix.ciphertext_modulus(), ciphertext_modulus);
/// ```
pub fn from_container(
container: C,
glwe_size: GlweSize,
polynomial_size: PolynomialSize,
ciphertext_modulus: CiphertextModulus<C::Element>,
) -> GgswLevelMatrix<C> {
assert!(
container.container_len() == ggsw_level_matrix_size(glwe_size, polynomial_size),
"The provided container length is not valid. \
Expected length of {} (glwe_size * glwe_size * polynomial_size), got {}",
ggsw_level_matrix_size(glwe_size, polynomial_size),
container.container_len(),
);
GgswLevelMatrix {
data: container,
glwe_size,
polynomial_size,
ciphertext_modulus,
}
}
/// Return the [`GlweSize`] of the [`GgswLevelMatrix`].
///
/// See [`GgswLevelMatrix::from_container`] for usage.
pub fn glwe_size(&self) -> GlweSize {
self.glwe_size
}
/// Return the [`PolynomialSize`] of the [`GgswLevelMatrix`].
///
/// See [`GgswLevelMatrix::from_container`] for usage.
pub fn polynomial_size(&self) -> PolynomialSize {
self.polynomial_size
}
/// Return the [`CiphertextModulus`] of the [`GgswLevelMatrix`].
///
/// See [`GgswLevelMatrix::from_container`] for usage.
pub fn ciphertext_modulus(&self) -> CiphertextModulus<C::Element> {
self.ciphertext_modulus
}
/// Interpret the [`GgswLevelMatrix`] as a [`GlweCiphertextList`].
pub fn as_glwe_list(&self) -> GlweCiphertextListView<'_, C::Element> {
GlweCiphertextListView::from_container(
self.data.as_ref(),
self.glwe_size,
self.polynomial_size,
self.ciphertext_modulus,
)
}
}
impl<Scalar: UnsignedInteger, C: ContainerMut<Element = Scalar>> GgswLevelMatrix<C> {
/// Mutable variant of [`GgswLevelMatrix::as_glwe_list`]
pub fn as_mut_glwe_list(&mut self) -> GlweCiphertextListMutView<'_, C::Element> {
GlweCiphertextListMutView::from_container(
self.data.as_mut(),
self.glwe_size,
self.polynomial_size,
self.ciphertext_modulus,
)
}
}
/// Metadata used in the [`CreateFrom`] implementation to create [`GgswLevelMatrix`] entities.
#[derive(Clone, Copy)]
pub struct GgswLevelMatrixCreationMetadata<Scalar: UnsignedInteger>(
pub GlweSize,
pub PolynomialSize,
pub CiphertextModulus<Scalar>,
);
impl<Scalar: UnsignedInteger, C: Container<Element = Scalar>> CreateFrom<C> for GgswLevelMatrix<C> {
type Metadata = GgswLevelMatrixCreationMetadata<C::Element>;
#[inline]
fn create_from(from: C, meta: Self::Metadata) -> GgswLevelMatrix<C> {
let GgswLevelMatrixCreationMetadata(glwe_size, polynomial_size, ciphertext_modulus) = meta;
GgswLevelMatrix::from_container(from, glwe_size, polynomial_size, ciphertext_modulus)
}
}
impl<Scalar: UnsignedInteger, C: Container<Element = Scalar>> ContiguousEntityContainer
for GgswCiphertext<C>
{
type Element = C::Element;
type EntityViewMetadata = GgswLevelMatrixCreationMetadata<Self::Element>;
type EntityView<'this> = GgswLevelMatrix<&'this [Self::Element]>
where
Self: 'this;
type SelfViewMetadata = ();
type SelfView<'this> = DummyCreateFrom
where
Self: 'this;
fn get_entity_view_creation_metadata(&self) -> Self::EntityViewMetadata {
GgswLevelMatrixCreationMetadata(
self.glwe_size,
self.polynomial_size,
self.ciphertext_modulus,
)
}
fn get_entity_view_pod_size(&self) -> usize {
self.ggsw_level_matrix_size()
}
/// Unimplemented for [`GgswCiphertext`]. At the moment it does not make sense to
/// return "sub" GgswCiphertext.
fn get_self_view_creation_metadata(&self) -> Self::SelfViewMetadata {
unimplemented!(
"This function is not supported for GgswCiphertext. \
At the moment it does not make sense to return 'sub' GgswCiphertext."
)
}
}
impl<Scalar: UnsignedInteger, C: ContainerMut<Element = Scalar>> ContiguousEntityContainerMut
for GgswCiphertext<C>
{
type EntityMutView<'this> = GgswLevelMatrix<&'this mut [Self::Element]>
where
Self: 'this;
type SelfMutView<'this> = DummyCreateFrom
where
Self: 'this;
}