#### Filter Results:

#### Publication Year

1994

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with embedding degree k = 10, which solves an open problem posed by Boneh, Lynn, and Shacham [6]. We show that our framework incorporates existing constructions for k = 3, 4, 6, and… (More)

We present algorithms which, given a genus 2 curve C defined over a finite field and a quartic CM field K, determine whether the endomorphism ring of the Jacobian J of C is the full ring of integers in K. In particular, we present probabilistic algorithms for computing the field of definition of, and the action of Frobenius on, the subgroups J[ℓ d ] for… (More)

We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. Our algorithm works for arbitrary embedding degrees k and prime subgroup orders r. The resulting abelian surfaces are defined over prime fields Fq with q ≈ r 4. We also provide an… (More)

Evidence from the lab and the field shows that most people exhibit substantial risk aversion over stakes of hundreds of dollars. Expected utility cannot capture nonnegli-gible risk aversion over such small stakes without producing implausible risk aversion over large stakes, and under the reduction of compound lotteries axiom, neither can non-expected… (More)

- ‹
- 1
- ›