LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1

Search filters

Refine by

30 documents, page 2 of 3

Schertz style class invariants for quartic CM fields

Enge, Andreas; Streng, Marco (2016)
Projects: EC | ANTICS (278537)
A class invariant is a CM value of a modular function that lies in a certain unramified class field. We show that Siegel modular functions over $\mathbb Q$ for $\Gamma^0(N)\subseteq \operatorname {Sp}_4(\mathbb Z)$ yield class invariants under some splitting conditions on $N$. Small class invariants speed up onstructions in explicit class field theory and public-key cryptography. Our results generalise results of Schertz's from elliptic curves to abelian varieties and from classical modular f...

A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties

Lubicz , David; Robert , Damien (2015)
Projects: EC | ANTICS (278537)
International audience; In this paper, we use the theory of theta functions to generalize to all abelian varieties the usual Miller's algorithm to compute a function associated to a principal divisor. We also explain how to use the Frobenius morphism on abelian varieties defined over a finite field in order to shorten the loop of the Weil and Tate pairings algorithms. This extend preceding results about ate and twisted ate pairings to all abelian varieties. Then building upon the two precedin...

Efficient implementation of elementary functions in the medium-precision range

Johansson, Fredrik (2014)
Projects: EC | ANTICS (278537)
International audience; We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and atan for variable precision up to approximately 4096 bits. Compared to the MPFR library, we achieve a maximum speedup ranging from a factor 3 for cos to 30 for atan. Our implementation uses table-based argument reduction together with rectangular splitting to evaluate Taylor series. We collect denominators to reduce the number of divisions in the Taylor series, and avoid ...

Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves

Cosset , Romain; Robert , Damien (2015)
Projects: EC | ANTICS (278537)
Accepté pour publication à Mathematics of Computations; International audience; In this paper, we compute l-isogenies between abelian varieties over a field of characteristic different from 2 in polynomial time in l, when l is an odd prime which is coprime to the characteristic. We use level n symmetric theta structure where n = 2 or n = 4. In a second part of this paper we explain how to convert between Mumford coordinates of Jacobians of genus 2 hyperelliptic curves to theta coordinates of ...

Computing hypergeometric functions rigorously

Johansson , Fredrik (2016)
Projects: EC | ANTICS (278537)
We present an efficient implementation of hypergeometric functions in arbitrary-precision interval arithmetic. The functions ${}_0F_1$, ${}_1F_1$, ${}_2F_1$ and ${}_2F_0$ (or the Kummer $U$-function) are supported for unrestricted complex parameters and argument, and by extension, we cover exponential and trigonometric integrals, error functions, Fresnel integrals, incomplete gamma and beta functions, Bessel functions, Airy functions, Legendre functions, Jacobi polynomials, complete elliptic ...

Computation of the Euclidean minimum of algebraic number fields

Lezowski , Pierre (2014)
Projects: EC | ANTICS (278537)
30 pages, shorter version, with many typos fixed; International audience; We present an algorithm to compute the Euclidean minimum of an algebraic number field, which is a generalization of the algorithm restricted to the totally real case described by Cerri. With a practical implementation, we obtain unknown values of the Euclidean minima of algebraic number fields of degree up to 8 in any signature, especially for cyclotomic fields, and many new examples of norm-Euclidean or non-norm-Euclid...

Bilinear pairings on elliptic curves

Enge , Andreas (2015)
Projects: EC | ANTICS (278537)
International audience; We give an elementary and self-contained introduction to pairings on elliptic curves over finite fields. For the first time in the literature, the three different definitions of the Weil pairing are stated correctly and proved to be equivalent using Weil reciprocity. Pairings with shorter loops, such as the ate, ate$_i$, R-ate and optimal pairings, together with their twisted variants, are presented with proofs of their bilinearity and non-degeneracy. Finally, we revie...

Computing modular Galois representations

Mascot, Nicolas (2012)
Projects: EC | ANTICS (278537)
International audience; We compute modular Galois representations associated with a newform $f$, and study the related problem of computing the coefficients of $f$ modulo a small prime $\ell$. To this end, we design a practical variant of the complex approximations method presented in the book edited by B. Edixhoven and J.-M. Couveignes. Its efficiency stems from several new ingredients. For instance, we use fast exponentiation in the modular jacobian instead of analytic continuation, which g...

Computing separable isogenies in quasi-optimal time

Lubicz , David; Robert , Damien (2015)
Projects: EC | ANTICS (278537)
International audience; Let $A$ be an abelian variety of dimension $g$ together with a principal polarization $\phi: A \rightarrow \hat{A}$ defined over a field $k$. Let $\ell$ be an odd integer prime to the characteristic of $k$ and let $K$ be a subgroup of $A[\ell]$ which is maximal isotropic for the Riemann form associated to $\phi$. We suppose that $K$ is defined over $k$ and let $B=A/K$ be the quotient abelian variety together with a polarization compatible with $\phi$. Then $B$, as a po...

Computation of Euclidean minima in totally definite quaternion fields

Cerri , Jean-Paul; Lezowski , Pierre (2017)
Projects: EC | ANTICS (278537)
22 pages, some improvements and corrections, especially in Sections 4 and 5.; We describe an algorithm that allows to compute the Euclidean minimum (for the norm form) of any order of a totally definite quaternion field over a number field K of degree strictly greater than 1. Our approach is a generalization of previous work dealing with number fields. The algorithm was practically implemented when K has degree 2.
Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok