Learn More
Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time Ln[1/3; c], where Ln[v; c] = exp{(c + o(1))(log n) v (log log n) 1−v }, for n → ∞. In this paper we present an algorithm to solve the discrete logarithm problem for GF (p) with heuristic expected running time Lp[1/3; 3 2/3 ]. For numbers of(More)
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We discover several things that were previously overlooked in the(More)
Fix n. Let r(n) denote the largest number r for which there is an r × n (1, −1)-matrix H satisfying the matrix equation HH ⊤ = nIr. The Hadamard conjecture states that for n divisible by 4 we have r(n) = n. Let ǫ > 0. In this paper, we show that the Extended Riemann Hypothesis and recent results on the asymptotic existence of Hadamard matrices imply that(More)
We recently described human leukocyte antigen (HLA) A2, A3 and B7 supertypes, characterized by largely overlapping peptide-binding specificities and represented in a high percentage of different populations. Here, we identified 17 Plasmodium falciparum peptides capable of binding these supertypes and assessed antigenicity in both vaccinated and naturally(More)
BACKGROUND Immunization with RTS,S/AS02 consistently protects some vaccinees against malaria infection in experimental challenges and in field trials. A brief immunization schedule against falciparum malaria would be compatible with the Expanded Programme on Immunization, or in combination with other prevention measures, interrupt epidemic malaria or(More)