qfall-math 0.1.1

Mathematical foundations for rapid prototyping of lattice-based cryptography
Documentation 
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

// Copyright © 2023 Marcel Luca Schmidt, Marvin Beckmann
//
// This file is part of qFALL-math.
//
// qFALL-math is free software: you can redistribute it and/or modify it under
// the terms of the Mozilla Public License Version 2.0 as published by the
// Mozilla Foundation. See <https://mozilla.org/en-US/MPL/2.0/>.

//! Integer-based types with arbitrary length based on [`Z`].
//!
//! This module contains the type [`Z`] for integers with arbitrary length and
//! constructions over it.
//! Each struct provides examples regarding usage.
//! In general you can mix [`Z`]'s with any type of rust integer, whenever the
//! corresponding method takes as input integers of type [`Into<Z>`],
//! e.g. the standard rust integers.

mod mat_poly_over_z;
mod mat_z;
mod poly_over_z;
mod z;

pub use mat_poly_over_z::MatPolyOverZ;
pub use mat_z::MatZ;
pub use poly_over_z::PolyOverZ;
pub(crate) use poly_over_z::fmpz_poly_helpers;
pub use z::Z;
pub(crate) use z::fmpz_helpers;