LOGIN TO YOUR ACCOUNT

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

CREATE AN ACCOUNT

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:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1

Search filters

Refine by

Publication Year

2014 (10)
2016 (10)
2013 (9)
2015 (5)
2012 (2)
View more
Publication Year

2014 (10)
2016 (10)
2013 (9)
2015 (5)
2012 (2)
2017 (2)
2010 (1)

Access Mode

Document Language

English (38)
French (1)
39 documents, page 1 of 4

Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language

Fieker, Claus; Hart, William; Hofmann, Tommy; Johansson, Fredrik (2017)
Projects: EC | ANTICS (278537)
International audience; We introduce two new packages, Nemo and Hecke, written in the Julia programming language for computer algebra and number theory. We demonstrate that high performance generic algorithms can be implemented in Julia, without the need to resort to a low-level C implementation. For specialised algorithms, we use Julia's efficient native C interface to wrap existing C/C++ libraries such as Flint, Arb, Antic and Singular. We give examples of how to use Hecke and Nemo and disc...

Dirichlet series associated to cubic fields with given quadratic resolvent

Cohen, Henri; Thorne, Frank (2013)
Projects: EC | ANTICS (278537)
International audience; Let k be a quadratic field. We give an explicit formula for the Dirichlet series enumerating cubic fields whose quadratic resolvent field is isomorphic to k. Our work is a sequel to previous work of Cohen and Morra, where such formulas are proved in a more general setting, in terms of sums over characters of certain groups related to ray class groups. In the present paper we carry the analysis further and prove explicit formulas for these Dirichlet series over Q. In a ...

Le grand théorème de Fermat

Cohen, Henri (2016)
Projects: EC | ANTICS (278537)
National audience; grand théorème de Fermat

Short addition sequences for theta functions

Enge, Andreas; Hart, William; Johansson, Fredrik (2016)
Projects: EC | ANTICS (278537)
The main step in numerical evaluation of classical Sl2 (Z) modular forms and elliptic functions is to compute the sum of the first N nonzero terms in the sparse q-series belonging to the Dedekind eta function or the Jacobi theta constants. We construct short addition sequences to perform this task using N + o(N) multiplications. Our constructions rely on the representability of specific quadratic progressions of integers as sums of smaller numbers of the same kind. For example, we show that e...

Computation of Euclidean minima in totally definite quaternion fields

Cerri, Jean-Paul; Lezowski, Pierre (2016)
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.

Elliptic curve cryptographic systems

Andreas Enge (2013)
Projects: EC | ANTICS (278537)
International audience

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 isogenies between abelian varieties

Lubicz, David; Robert, Damien (2010)
Projects: EC | ANTICS (278537)
We describe an efficient algorithm for the computation of separable isogenies between abelian varieties represented in the coordinate system given by algebraic theta functions. Let $A$ be an abelian variety of dimension $g$ defined over a field of odd characteristic. Our algorithm decomposes in two principal steps. First, given a theta null point for $A$ and a subgroup $K$ isotropic for the Weil pairing, we explain how to compute the theta null point corresponding to the quotient abelian vari...

Computing the residue of the Dedekind zeta function

Belabas, Karim; Friedman, Eduardo (2013)
Projects: EC | ANTICS (278537)
16 pages; International audience; Assuming the Generalized Riemann Hypothesis, Bach has shown that one can calculate the residue of the Dedekind zeta function of a number field K by a clever use of the splitting of primes p < X, with an error asymptotically bounded by 8.33 log D_K/(\sqrt{X}\log X), where D_K is the absolute value of the discriminant of K. Guided by Weil's explicit formula and still assuming GRH, we make a different use of the splitting of primes and thereby improve Bach's con...