Families of pairing-friendly abelian surfaces Below we give data and example curves for all of the families of abelian surfaces with ρ < 8 that we found using Algorithm 3.7 of [1]. For each...
David Freeman, Michael Scott, Edlyn Teske, M. Scott, E. Teske
Abstract. Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly ” curves are...
Abstract. We give an algorithm that produces families of Weil numbers for ordinary abelian varieties over finite fields with prescribed embedding degree. The algorithm uses the ideas of Freeman,...
Signing a Linear Subspace: Signature Schemes for Network Coding (2009)
Dan Boneh, David Freeman, Jonathan Katz
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding requires...
Signing a Linear Subspace: Signature Schemes for Network Coding (2009)
Dan Boneh, David Freeman, Jonathan Katz, Brent Waters
Abstract. Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding...
Steven Best, Takis Nikolopoulos, Panayotis Koumentakis, Rafael Spósito, Guido Galafassi, David Freeman, ...
Edited by Steven Best. This IJID publication is an English translation of the book with the same title published in Athens in 2008 (Koukkida) ISBN 978-960-98038-5-4. Copyright (C) reserved for the...
Abelian varieties with prescribed embedding degree (2008)
David Freeman, Peter Stevenhagen, Marco Streng
Abstract. We present an algorithm that, on input of a CM-field K, an integer k ≥ 1, and a prime r ≡ 1 mod k, constructs a q-Weil number π ∈ OK corresponding to an ordinary, simple abelian...
Abelian Varieties with Prescribed Embedding Degree (2008)
Freeman, David, Stevenhagen, Peter, Streng, Marco
We present an algorithm that, on input of a CM-field $K$, an integer $k\ge1$, and a prime $r \equiv 1 \bmod k$, constructs a $q$-Weil number $\pi \in \O_K$ corresponding to an ordinary, simple...
Computing endomorphism rings of Jacobians of genus 2 curves over finite fields (2007)
Freeman, David, Lauter, Kristin
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...
Constructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians (2007)
Abstract. 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...
Constructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians (2007)
Abstract. 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...
Constructing pairing-friendly elliptic curves with embedding degree 10 (2006)
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...
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10 (2006)
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...
A taxonomy of pairing-friendly elliptic curves (2006)
David Freeman, Michael Scott, Edlyn Teske
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairing-based cryptographic systems. Such “pairing-friendly” curves are rare and...
David Freeman, Michael Scott, Edlyn Teske, E. Teske
Abstract. Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly ” curves are...
Computing endomorphism rings of Jacobians of genus 2 curves (2006)
Abstract. We present probabilistic 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...
David Freeman, Michael Scott, Edlyn Teske, E. Teske
Abstract. Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly ” curves are...
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10 (2006)
Abstract. 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...
Computing endomorphism rings of Jacobians of genus 2 curves (2006)
Abstract. 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...
Pairing-based identification schemes (2005)
We propose four different identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more efficient and/or...
Inclusive democracy and its prospects (2005)
Takis Fotopoulos’ inclusive democracy project has generated one of the most interesting and ambitious undertakings within contemporary political philosophy. Fotopoulos synthesises what he regards...
Pairing-Based Identification Schemes (2005)
We propose four di#erent identification schemes that make use of bilinear pairings, and prove their security under certain computational assumptions. Each of the schemes is more e#cient and/or more...
PAIRING-BASED IDENTIFICATION SCHEMES (2005)
public-key cryptography, identification, zero-knowledge, pairings We present several different identification schemes that make use of bilinear pairings. Each of the schemes is more efficient and/or...
CONSTRUCTING FAMILIES OF PAIRING-FRIENDLY ELLIPTIC CURVES. (2005)
cryptography, pairings, elliptic curves, embedding degree We present a general method for constructing families of elliptic curves with prescribed embedding degree and prime order. We demonstrate...
Fast arithmetic and pairing evaluation on genus 2 curves (2005)
We present two algorithms for fast arithmetic in Jacobians of genus 2 curves. The first speeds up the process of “double-and-add ” by an estimated 5.5 % over the standard algorithm. The second...
Inclusive democracy and its prospects (2004)
This article is organised into two parts. Part I revisits Takis Fotopoulos¿ (1997) Towards an Inclusive Democracy and deploys the discursive and interlocutory device of seeking to anticipate the...
Inclusive democracy and its prospects (2004)
This article is organised into two parts. Part I revisits Takis Fotopoulos¿ (1997) Towards an Inclusive Democracy and deploys the discursive and interlocutory device of seeking to anticipate the...
J. Aust. Math. Soc. 78 (2005), 1–31 THE ISOPERIMETRIC PROBLEM ON SOME SINGULAR SURFACES (2002)
Andrew Cotton, David Freeman, Andrei Gnepp, Ting Ng, John Spivack, Cara Yoder, ...
We characterize least-perimeter enclosures of prescribed area on some piecewise smooth manifolds, including certain polyhedra, double spherical caps, and cylindrical cans. 2000 Mathematics subject...
© Hindawi Publishing Corp. THE DOUBLE BUBBLE PROBLEM IN SPHERICAL AND HYPERBOLIC SPACE (2002)
We prove that the standard double bubble is the least-area way to enclose and separate two regions of equal volume in H 3, and in S 3 when the exterior is at least ten percent of S 3. 2000...
The double bubble problem in spherical and hyperbolic space (2002)
We prove that the standard double bubble is the least-area way to enclose and separate two regions of equal volume in ℍ3, and in S3 when the exterior is at least ten percent of S3.
Gramática a l' aula.' La gramática en el aula' (2000)
Camps Mundó, Anna, Ferrer, Montserrat, Bartra I Kaufmann, Anna, Bernárdez Sanchis, Enrique, Bronckart, Jean-Paul, Cuenca, M. Josep, ...
Estudio reflexivo y crítico sobre la introducción de la gramática en el aula en los distintos niveles educativos. Se parte de las aportaciones de distintas disciplinas en la enseñanza y...
An experimental investigation of the construct self-cognition. (1960)
Thesis (Ph. D.)--School of Education, Stanford University, January 1960.
An experimental investigation of the construct self-cognition [microform] / (1960)
Thesis (Ph. D.)--Stanford University, 1960.