Randomness-efficient curve sampling

Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling property: the restriction of low-degree polynomials over the domain to the sampled curve is still low-degree. This property is often used in combination with the sampling property and has found many applications, including PCP constructions, local decoding of codes, and algebraic PRG constructions.

The randomness complexity of curve samplers is a crucial parameter for its applications. It is known that (non-explicit) curve samplers using O(log N + log(1/δ)) random bits exist, where N is the domain size and δ is the confidence error. The question of explicitly constructing randomness-efficient curve samplers was first raised in [TU06] where they obtained curve samplers with near-optimal randomness complexity.

In this thesis, we present an explicit construction of low-degree curve samplers with optimal randomness complexity (up to a constant factor) that sample curves of degree (m log_q(1/δ))^O(1) in F_q^m. Our construction is a delicate combination of several components, including extractor machinery, limited independence, iterated sampling, and list-recoverable codes.

On the distribution of the signs of the conjugates of the cyclotomic units in the maximal real subfield of the qth cyclotomic field, q A prime

Let F = Ǫ(ζ + ζ ^–1) be the maximal real subfield of the cyclotomic field Ǫ(ζ) where ζ is a primitive qth root of unity and q is an odd rational prime. The numbers u₁=-1, u_k=(ζ^k-ζ^-k)/(ζ-ζ^-1), k=2,…,p, p=(q-1)/2, are units in F and are called the cyclotomic units. In this thesis the sign distribution of the conjugates in F of the cyclotomic units is studied.

Let G(F/Ǫ) denote the Galoi's group of F over Ǫ, and let V denote the units in F. For each σϵ G(F/Ǫ) and μϵV define a mapping sgn_σ: V→GF(2) by sgn_σ(μ) = 1 iff σ(μ) ˂ 0 and sgn_σ(μ) = 0 iff σ(μ) ˃ 0. Let {σ₁, ... , σ_p} be a fixed ordering of G(F/Ǫ). The matrix M_q=(sgn_σj(v_i) ) , i, j = 1, ... , p is called the matrix of cyclotomic signatures. The rank of this matrix determines the sign distribution of the conjugates of the cyclotomic units. The matrix of cyclotomic signatures is associated with an ideal in the ring GF(2) [x] / (x^p+ 1) in such a way that the rank of the matrix equals the GF(2)-dimension of the ideal. It is shown that if p = (q-1)/ 2 is a prime and if 2 is a primitive root mod p, then M_q is non-singular. Also let p be arbitrary, let ℓ be a primitive root mod q and let L = {i | 0 ≤ i ≤ p-1, the least positive residue of defined by ℓⁱ mod q is greater than p}. Let H_q(x) ϵ GF(2)[x] be defined by H_q(x) = g. c. d. ((Σ xⁱ/I ϵ L) (x+1) + 1, x^p + 1). It is shown that the rank of M_q equals the difference p - degree H_q(x).

Further results are obtained by using the reciprocity theorem of class field theory. The reciprocity maps for a certain abelian extension of F and for the infinite primes in F are associated with the signs of conjugates. The product formula for the reciprocity maps is used to associate the signs of conjugates with the reciprocity maps at the primes which lie above (2). The case when (2) is a prime in F is studied in detail. Let T denote the group of totally positive units in F. Let U be the group generated by the cyclotomic units. Assume that (2) is a prime in F and that p is odd. Let F₍₂₎ denote the completion of F at (2) and let V₍₂₎ denote the units in F₍₂₎. The following statements are shown to be equivalent. 1) The matrix of cyclotomic signatures is non-singular. 2) U∩T = U². 3) U∩F²₍₂₎ = U². 4) V₍₂₎/ V₍₂₎² = ˂v₁ V₍₂₎²˃ ʘ…ʘ˂v_p V₍₂₎²˃ ʘ ˂3V₍₂₎²˃.

The rank of M_q was computed for 5≤q≤929 and the results appear in tables. On the basis of these results and additional calculations the following conjecture is made: If q and p = (q -1)/ 2 are both primes, then M_q is non-singular.