struct_siqs_sieve_t Struct Reference

Defines the sieve used by SIQS. More...

#include <lib/utils/include/siqs_sieve.h>

Data Fields
uint32_t	nchunks
uint32_t	chunk_size
int32_t	next_chunkno_to_fill
uint32_t	scan_begin
uint32_t	threshold
byte_array_t *	log_primes
byte_array_t *	sieve
siqs_poly_t *	poly
int32_array_t *	sol1
int32_array_t *	sol2
uint32_t	endlast
bool	use_buckets
uint32_t	nprimes_no_buckets
uint32_t	buckets_first_prime
buckets_t *	buckets_positive
buckets_t *	buckets_negative
stopwatch_t	init_poly_timer
stopwatch_t	fill_timer
stopwatch_t	scan_timer

---

Detailed Description

Defines the sieve used by SIQS.

This structure defines the sieve used by SIQS together with all its associated data.

Definition at line 122 of file siqs_sieve.h.

---

Field Documentation

uint32_t struct_siqs_sieve_t::nchunks

Number of blocks to sieve on each side of zero (nchunks for positive x and nchunks for negative x)

Definition at line 127 of file siqs_sieve.h.

uint32_t struct_siqs_sieve_t::chunk_size

Size of a sieve chunk. The total sieving interval is thus given by 2 * chunk_size * nchunks

Definition at line 132 of file siqs_sieve.h.

int32_t struct_siqs_sieve_t::next_chunkno_to_fill

The number of the next sieve chunk to fill (in [nchunks, 0[ U ]0, nchunks])

Definition at line 137 of file siqs_sieve.h.

uint32_t struct_siqs_sieve_t::scan_begin

The position to start scanning in the next sieve chunk to scan

Definition at line 141 of file siqs_sieve.h.

uint32_t struct_siqs_sieve_t::threshold

The sieve threshold. An xi will be tested for smoothness if sieve[xi] < threshold

Definition at line 146 of file siqs_sieve.h.

byte_array_t* struct_siqs_sieve_t::log_primes

Approximated logarithm (in base 2) of the primes in the factor base

Definition at line 150 of file siqs_sieve.h.

byte_array_t* struct_siqs_sieve_t::sieve

The actual sieve array, of size chunk_size

Definition at line 154 of file siqs_sieve.h.

siqs_poly_t* struct_siqs_sieve_t::poly

The SIQS polynomial

Definition at line 158 of file siqs_sieve.h.

int32_array_t* struct_siqs_sieve_t::sol1

The first solution to the equation P(x) = 0 mod pi for each prime pi in the factor base

Definition at line 163 of file siqs_sieve.h.

int32_array_t* struct_siqs_sieve_t::sol2

The first solution to the equation P(x) = 0 mod pi for each prime pi in the factor base

Definition at line 168 of file siqs_sieve.h.

uint32_t struct_siqs_sieve_t::endlast

The index of the last position to sieve in the last sieve chunk (on either side)

Definition at line 174 of file siqs_sieve.h.

bool struct_siqs_sieve_t::use_buckets

Should we use a bucket sieving for the largest primes in the base?

Definition at line 180 of file siqs_sieve.h.

uint32_t struct_siqs_sieve_t::nprimes_no_buckets

Index (in the factor base) of the largest prime for which a standard sieving procedure is use

Definition at line 185 of file siqs_sieve.h.

uint32_t struct_siqs_sieve_t::buckets_first_prime

Index (in the factor base) of the smallest prime for which the bucket sieving procedure is use

Definition at line 190 of file siqs_sieve.h.

buckets_t* struct_siqs_sieve_t::buckets_positive

Buckets for the positive x's

Definition at line 194 of file siqs_sieve.h.

buckets_t* struct_siqs_sieve_t::buckets_negative

Buckets for the negative x's

Definition at line 198 of file siqs_sieve.h.

stopwatch_t struct_siqs_sieve_t::init_poly_timer

Additional stopwatch (to get timing for the polynomial initializations)

Definition at line 202 of file siqs_sieve.h.

stopwatch_t struct_siqs_sieve_t::fill_timer

Additional stopwatch (to get timing for the sieve filling)

Definition at line 206 of file siqs_sieve.h.

stopwatch_t struct_siqs_sieve_t::scan_timer

Additional stopwatch (to get timing for the sieve scanning)

Definition at line 210 of file siqs_sieve.h.

---

The documentation for this struct was generated from the following file:

• siqs_sieve.h