sdfq_problem¶
- class cryptographic_estimators.SDFqEstimator.sdfq_problem.SDFqProblem(n: int, k: int, w: int, q: int, **kwargs)¶
Bases:
BaseProblem
Construct an instance of the Syndrome Decoding over Fq Problem.
- Parameters:
n (int) – The code length.
k (int) – The code dimension.
w (int) – The error weight.
q (int) – The size of the base field of the code.
nsolutions (int) – The number of (expected) solutions of the problem in logarithmic scale.
is_syndrome_zero (bool, optional) – If set to true, special algorithmic optimizations can be applied. Defaults to True.
- expected_number_solutions()¶
Returns the logarithm of the expected number of existing solutions to the problem.
- get_parameters()¶
Returns the ISD parameters n, k, w, q.
- Returns:
A tuple containing the ISD parameters n, k, w, q.
- Return type:
tuple
- to_bitcomplexity_memory(elements_to_store: float)¶
Returns the memory bit-complexity associated with a given number of elements to store.
- Parameters:
elements_to_store (float) – The number of elements to store (in logarithmic scale).
- to_bitcomplexity_time(basic_operations: float)¶
Calculates the bit-complexity corresponding to the number of field additions.
- Parameters:
basic_operations (float) – The number of field additions (logarithmic).