hal.maths.nt package

Submodules

hal.maths.nt.primes module

Primes functions

class hal.maths.nt.primes.Integer(string)[source]

Bases: object

Big int std python won’t recognize

is_naive_prime()[source]

Checks if prime in very naive way :return: True iff prime

is_probably_prime()[source]

Tests with miller-rabin :return: True iff prime

test_miller_rabin(precision)[source]

Tests prime with miller-rabin algorithm

Parameters:precision – number of rounds to perform
Returns:True iff probably prime
hal.maths.nt.primes.blum_blum_shub(seed, amount, prime0, prime1)[source]

Creates pseudo-number generator

Parameters:
  • seed – seeder
  • amount – amount of number to generate
  • prime0 – one prime number
  • prime1 – the second prime number
Returns:

pseudo-number generator
hal.maths.nt.primes.get_prime(bits)[source]

Creates (probable) prime number of given size

Parameters:bits – size of number to generate
Returns:prime number of given size