Filter your results
- 22
- 4
- 1
- 15
- 6
- 2
- 1
- 1
- 1
- 1
- 23
- 13
- 1
- 1
- 1
- 1
- 4
- 2
- 1
- 1
- 3
- 1
- 3
- 1
- 3
- 1
- 1
- 2
- 24
- 2
- 1
- 15
- 15
- 12
- 11
- 4
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 27
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
27 Results
|
|
sorted by
|
|
Le programme HACIENDA2014
Other publications
hal-01112274v1
|
||
|
The arithmetic of Jacobian groups of superelliptic cubicsMathematics of Computation, 2005, 74 (249), pp.389-410
Journal articles
inria-00071967v2
|
||
|
Generalised Weber FunctionsActa Arithmetica, 2014, 164 (4), pp.309-341. ⟨10.4064/aa164-4-1⟩
Journal articles
inria-00385608v2
|
||
|
The complexity of class polynomial computation via floating point approximationsMathematics of Computation, 2009, 78 (266), pp.1089-1107
Journal articles
inria-00001040v3
|
||
|
Hyperelliptic Cryptosystems – Efficiency and Subexponential AttacksMathematics [math]. Universität Augsburg, 2000. English. ⟨NNT : ⟩
Theses
tel-00505980v1
|
||
Modular Curves of Composite LevelActa Arithmetica, 2005, 118 (2), pp.129-141
Journal articles
inria-00386309v1
|
|||
|
Discrete logarithms in curves over finite fieldsEighth International Conference on Finite Fields and Applications - Fq8, Jul 2007, Melbourne, Australia. pp.119-139
Conference papers
inria-00201090v1
|
||
|
Computing Hilbert Class PolynomialsANTS-VIII - Eighth Algorithmic Number Theory Symposium, May 2008, Banff, Canada. pp.282-295
Conference papers
inria-00246115v1
|
||
|
Elliptic curve cryptographic systemsGary L. Mullen and Daniel Panario. Handbook of Finite Fields, Chapman and Hall/CRC, pp.784-796, 2013, Discrete Mathematics and Its Applications, 9781439873786
Book sections
hal-00764963v1
|
||
|
Bilinear pairings on elliptic curvesL'Enseignement Mathématique , 2015, 61 (2), pp.211-243
Journal articles
hal-00767404v2
|
||
|
[Re] Volume computation for polytopes: Vingt ans aprèsThe ReScience journal, 2020, 6 (1), pp.#17. ⟨10.5281/zenodo.4242972⟩
Journal articles
hal-03053781v1
|
||
|
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree CurvesJournal of Cryptology, 2011, 24, pp.24-41. ⟨10.1007/s00145-010-9057-y⟩
Journal articles
inria-00383941v2
|
||
|
Short addition sequences for theta functionsJournal of Integer Sequences, 2018, 18 (2), pp.1-34
Journal articles
hal-01355926v2
|
||
|
Schertz style class invariants for quartic CM fields2016
Preprints, Working Papers, ...
hal-01377376v2
|
||
Implementing the Arithmetic of C3,4 CurvesANTS-VI - 6th International Symposium on Algorithmic Number Theory, Jun 2004, Burlington, VT, United States. pp.87-101, ⟨10.1007/978-3-540-24847-7_6⟩
Conference papers
istex
hal-01497045v1
|
|||
|
Singular values of multiple eta-quotients for ramified primesLMS Journal of Computation and Mathematics, 2013, 16, pp.407-418. ⟨10.1112/S146115701300020X⟩
Journal articles
hal-00768375v2
|
||
Building curves with arbitrary small MOV degree over finite prime fieldsJournal of Cryptology, 2005, 18 (2), pp.79-89
Journal articles
inria-00386299v1
|
|||
|
A general framework for subexponential discrete logarithm algorithmsActa Arithmetica, 2002, 102, pp.83-103. ⟨10.4064/aa102-1-6⟩
Journal articles
inria-00512717v1
|
||
|
Courbes Algébriques et CryptologieMathématiques [math]. Université Paris-Diderot - Paris VII, 2007
Habilitation à diriger des recherches
tel-00382535v1
|
||
|
Exact Volume Computation for Polytopes: A Practical StudyPolytopes — Combinatorics and Computation, Birkhäuser Basel, pp.131-154, 2000, ⟨10.1007/978-3-0348-8438-9_6⟩
Book sections
hal-03029034v1
|
||
|
An $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree CurvesEurocrypt 2007, May 2007, Barcelona, Spain. pp.379-393
Conference papers
inria-00135324v1
|
||
|
Komplexe Multiplikation: von numerisch bis symbolischComputer-Algebra-Rundbrief, 2009, 45, pp.13-17
Journal articles
inria-00429093v1
|
||
|
Class invariants by the CRT methodNinth Algorithmic Number Theory Symposium ANTS-IX, Jul 2010, Nancy, France. pp.142-156, ⟨10.1007/978-3-642-14518-6_14⟩
Conference papers
inria-00448729v2
|
||
|
Computing modular polynomials in quasi-linear timeMathematics of Computation, 2009, 78 (267), pp.1809-1824
Journal articles
inria-00143084v2
|
||
|
Implementing cryptographic pairings at standard security levelsSecurity, Privacy, and Applied Cryptography Engineering, Oct 2014, Pune, India. pp.28-46, ⟨10.1007/978-3-319-12060-7_3⟩
Conference papers
hal-01034213v1
|
||
Provably Secure Non-Interactive Key Distribution Based on PairingsDiscrete Applied Mathematics, 2006, 154 (2), pp.270-276
Journal articles
inria-00386311v1
|
|||
|
Computing class polynomials for abelian surfacesExperimental Mathematics, 2014, 23 (2), pp.129-145. ⟨10.1080/10586458.2013.878675⟩
Journal articles
hal-00823745v2
|