In most algorithms involving elliptic and hyperelliptic curves, the costliest part consists in computing multiples of ideal classes. This paper investigates how to compute faster doubling over fields of characteristic two. We derive explicit doubling formulae making strong use of the defining equation of the curve. We analyze how many field operations are needed depending on the curve making cl...

This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formulas for binary elliptic curves, i.e., addition formulas that work for all pairs of input points, with no exceptional cases. If n ≥ 3 then the complete curves cover all isomorphism classes of ordinary elliptic curves over F2n . Th...

The present experiments tested the claim that phonological recoding occurs "automatically" by assessing whether it uses central attention in the context of the psychological refractory period paradigm. Task 1 was a tone discrimination task and Task 2 was reading aloud. The joint effects of long-lag word repetition priming and stimulus onset asynchrony (SOA) were underadditive in Experiment 1, s...

In this paper we study the local behavior of a solution to the Lamé system when the Lamé coefficients λ and μ satisfy that μ is Lipschitz and λ is essentially bounded in dimension n ≥ 2. One of the main results is the local doubling inequality for the solution of the Lamé system. This is a quantitative estimate of the strong unique continuation property. Our proof relies on Carleman estimates w...