regsd_problem

class cryptographic_estimators.RegSDEstimator.regsd_problem.RegSDProblem(n: int, k: int, w: int, **kwargs)

Bases: BaseProblem

Construct an instance of the Regular Syndrome Decoding Problem.

Parameters:

  • n (int) – Code length

  • k (int) – Code dimension

  • w (int) – Error weight

  • **kwargs –

    Additional keyword arguments

    nsolutions - Number of (expected) solutions of the problem in logarithmic scale

    memory_bound - Maximum allowed memory to use for solving the problem

expected_number_solutions()

Return the logarithm of the expected number of existing solutions to the problem.

get_parameters()

Return the optimizations parameters.

to_bitcomplexity_memory(elements_to_store: float)

Return the memory bit-complexity associated to a given number of elements to store.

Parameters:

elements_to_store (float) – Number of memory operations (logarithmic)

to_bitcomplexity_time(basic_operations: float)

Return the bit-complexity corresponding to a certain amount of basic_operations.

Parameters:

basic_operations (float) – Number of basic operations (logarithmic)