Project-Team TANC

Project-Team TANC

Cached

Download Links

[raweb.inria.fr]

by Théorie Algorithmique Des Nombres Pour , La Cryptologie , Main Topics

BibTeX

@MISC{Pour_project-teamtanc,
    author = {Théorie Algorithmique Des Nombres Pour and La Cryptologie and Main Topics},
    title = {Project-Team TANC},
    year = {}
}

Bookmark

OpenURL

Abstract

c t i v it y e p o r t 2007 Table of contents

Citations

635	publications by the team in recent years - Major
165	A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, Algorithmic Number Theory - Adleman, DeMarrais, et al. - 1994
65	An algorithm for solving the discrete log problem on hyperelliptic curves - Gaudry - 2000
43	and M.Scott. Constructing elliptic curves with prescribed embedding degree, 2002, Available at http://eprint.iacr.org/2002/008 - Barreto
42	P.: A General Framework for Subexponential Discrete Logarithm Algorithms - Enge, Gaudry - 2002
36	Construction of Secure Random Curves of Genus 2 over Prime Fields - GAUDRY, SCHOST
33	Computing discrete logarithms in high-genus hyperelliptic jacobians in provably subexponential time - Enge
27	Elliptic Curves and Their Applications to Cryptography—An Introduction - Enge - 1999
27	Building curves with arbitrary small mov degree over finite prime fields 2002, Available at http://eprint.iacr.org - Dupont, Enge, et al.
25	The complexity of class polynomial computation via floating point approximations - Enge
23	Implementing the asymptotically fast version of the elliptic curve primality proving algorithm - Morain - 2007
23	Fast algorithms for computing isogenies between elliptic curves - Bostan, Morain, et al. - 2006
21	The arithmetic of Jacobian groups of superelliptic cubics - BASIRI, ENGE, et al.
20	Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves, Finite fields and applications - Bostan, Gaudry, et al. - 2004
19	Comparing invariants for class fields of imaginary quadratic fields - Enge, Morain - 2002
19	Constructing elliptic curves over finite fields using double eta-quotients. Journal de Théorie des Nombres de - Enge, Schertz - 2004
15	Counting points in medium characteristic using Kedlaya’s algorithm - Gaudry, Gürel
15	Quelques calculs en théorie des nombres, Thèse, Université de Bordeaux I - COUVEIGNES - 1994
14	An extension of Kedlaya’s point-counting algorithm to superelliptic curves - Gaudry, Gürel - 2001
14	Computing modular polynomials in quasi-linear time - Enge
12	A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2 - Gaudry
11	Modular equations for hyperelliptic curves - GAUDRY, SCHOST
11	Fast evaluation of modular functions using Newton iterations and the AGM - Dupont
10	Proving the primality of very large numbers with fastECPP, in "Algorithmic Number Theory - FRANKE, KLEINJUNG, et al. - 2004
9	Fast decomposition of polynomials with known Galois group - Enge, Morain - 2003
8	An L(1/3+ε) algorithm for the discrete logarithm problem for low degree curves - Enge, Gaudry - 2007
8	Computing the cardinality of CM elliptic curves using torsion points, in "Journal de Théorie des Nombres de Bordeaux", vol. 19, n o 3 - MORAIN
8	Moyenne arithmético-géométrique, suites de Borchardt et applications - Dupont - 2006
7	Proving primality in essentially quartic expected time - BERNSTEIN
6	Algebraic groups and discrete logarithms, in Public-Key Cryptography and Computational - Couveignes - 2001
5	Factoring integers with the self-initializing quadratic sieve - CONTINI - 1997
4	Computing l-isogenies using the p-torsion, in "Algorithmic Number Theory - COUVEIGNES - 1996
3	primalité en temps polynomial [d’après - La
3	Computing the eigenvalue in the SchoofElkies-Atkin algorithm using Abelian lifts - Morain, Mihailescu, et al. - 2007
3	Implementing the arithmetic of C3,4 curves. In Algorithmic number theory, volume 3076 - Basiri, Enge, et al. - 2004