Project-Team CACAO Curves, Algebra, Computer Arithmetic, and so On

Project-Team CACAO Curves, Algebra, Computer Arithmetic, and so On

Cached

Download Links

by Nancy Grand Est

BibTeX

@MISC{Est_project-teamcacao,
    author = {Nancy Grand Est},
    title = {Project-Team CACAO Curves, Algebra, Computer Arithmetic, and so On},
    year = {}
}

Bookmark

OpenURL

Abstract

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

Citations

635	publications by the team in recent years - Major
553	Factoring Polynomials with Rational Coefficients - Lenstra, Lovàsz - 1982
55	Standard specifications for public key cryptography - IEEE - 2000
35	MPFR: A Multiple-Precision Binary Floating-Point - FOUSSE, HANROT, et al. - 2005
33	A double large prime variation for small genus hyperelliptic index calculus - Gaudry, Thomé, et al.
30	A hierarchy of polynomial lattice basis reduction algorithms - Schnorr - 1987
20	Symmetric Boolean functions - Canteaut, Videau - 2005
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
16	Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm - Hanrot, Stehlé - 2007
14	The mpFq library and implementing curve-based key exchanges - Gaudry, Thomé - 2007
13	Fast genus 2 arithmetic based on Theta functions, 2005, to appear - Gaudry
12	Index calculus in class groups of non-hyperelliptic curves of genus three - Diem, Thomé
12	Extraits de lettres de M. Hermite à M. Jacobi sur diff’erent objets de la théorie des nombres, deuxième lettre - Hermite
12	Proposal for a Standardization of Mathematical Function Implementation in Floating-Point Arithmetic, in "Numerical Algorithms", vol. 37, n o 1-2 - DEFOUR, HANROT, et al.
11	Use of elliptic curves in cryptography, Advances in cryptology— CRYPTO ’85 - Miller - 1985
10	B.: A computational approach to pocklington certificates in type theory - Grégoire, Théry, et al. - 2006
9	Computing the endomorphism ring of an ordinary elliptic curve over a finite field - Bisson, Sutherland - 2009
9	A GMP-based implementation of Schönhage-Strassen’s large integer multiplication algorithm - Gaudry, Kruppa, et al. - 2007
8	An L(1/3+ε) algorithm for the discrete logarithm problem for low degree curves - Enge, Gaudry - 2007
7	Time- and space-efficient evaluation of some hypergeometric constants - Cheng, Hanrot, et al. - 2007
6	The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines, in "Finite Fields and Their Applications", vol. 15, n o 2 - GAUDRY, LUBICZ
6	Computing relations in divisor class groups of algebraic curves over finite fields - Hess - 2004
5	A multi-level blocking distinct degree factorization algorithm - Brent, Zimmermann - 2007
5	Index Calculus for Abelian Varieties of Small Simension and the Elliptic Curve Discrete Logarithm Problem - Gaudry
4	Modern Computer Arithmetic - Brent, Zimmermann - 2008
4	Indifferentiability with Distinguishers: Why Shabal does not require ideal ciphers. IACR ePrint Archive: Report 2009/199 - Bresson, Canteaut, et al. - 2009
4	F.: Fast architectures for the ηT pairing over small-characteristic supersingular elliptic curves - Beuchat, Detrey, et al. - 2011
4	a submission to NIST’cryptographic hash algorithm competition. Submission to the NIST Hash competition - Shabal - 2008
4	Error bounds on complex floating-point multiplication - Brent, Percival, et al.
4	When e-th roots become easier than factoring - Joux, Naccache, et al. - 2007
3	Worst-case Hermite-Korkine-Zolotarev reduced lattice bases - Hanrot, Stehlé
3	Worst Cases of a Periodic Function for Large Arguments - HANROT, LEFÈVRE, et al.
2	Computing predecessor and successor in rounding to nearest - RUMP, ZIMMERMANN, et al.
2	Factorization with genus 2 curves - Cosset
2	Hardware Accelerator for the Tate Pairing - BEUCHAT, DETREY, et al.
2	Mapping Computation with No Memory - GIOAN, BURCKEL, et al.
2	Familles de courbes adaptées à la factorisation des entiers, 2009, http://hal.inria.fr/inria00419218/en/, Internship report - BARBULESCU
2	An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves, 2009, http://hal.inria.fr/inria-00383941/en/, Accepted for publication in Journal of Cryptology - ENGE, GAUDRY, et al.
2	Computing modular correspondences for abelian varieties - Faugère, Lubicz, et al. - 2009
2	Primality Proving with Elliptic Curves - THÉRY, HANROT
1	Ten new primitive binary trinomials, in "Mathematics of Computation - BRENT, ZIMMERMANN
1	Landau’s function for one million billions, in "Journal de Théorie des Nombres de Bordeaux", 2009, à paraître, http://hal.archives-ouvertes.fr/hal-00264057/en/. CACAO - DELÉGLISE, NICOLAS, et al.
1	More Discriminants with the Brezing-Weng Method - BISSON, SATOH
1	Improved Stage 2 to P±1 Factoring Algorithms - MONTGOMERY, KRUPPA
1	for Floating-Point Arithmetic, Revision of ANSI-IEEE Standard 754-1985, approved June 12, 2008 - Standard - 2008
1	Elliptic curve cryptosystems, in "Math. Comp.", n o 48 - KOBLITZ - 1987
1	New record breaking implementations of ECC on quadratic extensions using endomorphisms - SCOTT
1	Modern Computer Arithmetic, Version 0.4, 2009, http://wwwmaths.anu.edu. au/~brent/pub/pub226.html - BRENT, ZIMMERMANN
1	Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms - JOUX, LERCIER, et al.
1	Aspects techniques de la preuve reposant sur l’écrit électronique, in "La preuve des actes juridiques électroniques privés : mosaïque des droits européens ou trait d’Union - VIDEAU - 2009