Trait malachite_base::num::arithmetic::traits::ModSquare

source · 
pub trait ModSquare<M = Self> {
    type Output;

    fn mod_square(self, m: M) -> Self::Output;
}
Expand description

Squares a number modulo another number $m$. Assumes the input is already reduced modulo $m$.

Required Associated Types§

Required Methods§

Implementations on Foreign Types§

Squares a number modulo another number $m$. Assumes the input is already reduced modulo $m$.

$f(x, m) = y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$. Assumes the input is already reduced modulo $m$.

$f(x, m) = y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$. Assumes the input is already reduced modulo $m$.

$f(x, m) = y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$. Assumes the input is already reduced modulo $m$.

$f(x, m) = y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$. Assumes the input is already reduced modulo $m$.

$f(x, m) = y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$. Assumes the input is already reduced modulo $m$.

$f(x, m) = y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors§