Filtrer vos résultats
- 74
- 25
- 1
- 37
- 26
- 11
- 8
- 4
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 3
- 93
- 23
- 1
- 1
- 1
- 2
- 10
- 16
- 13
- 16
- 22
- 19
- 90
- 9
- 1
- 100
- 100
- 11
- 10
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 21
- 20
- 20
- 10
- 8
- 7
- 7
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
100 résultats
Modern Computer ArithmeticCambridge University Press, 18, 221 p., 2010, Cambridge Monographs on Applied and Computational Mathematics, 978-0-521-19469-3
Ouvrages
inria-00424347v1
|
|||
|
Efficient and accurate computation of upper bounds of approximation errorsTheoretical Computer Science, 2011, 412 (16), pp.1523-1543. ⟨10.1016/j.tcs.2010.11.052⟩
Article dans une revue
ensl-00445343v2
|
||
|
Algorithmes de comptage de points d'une courbe définie sur un corps finiKarim Belabas. Explicit Methods in Number Theory Rational Points and Diophantine Equations, 36, SMF, 2013, Panoramas et synthèses
Chapitre d'ouvrage
hal-00840136v1
|
||
|
Algorithmes et arithmétique pour l'implémentation de couplages cryptographiquesCryptographie et sécurité [cs.CR]. Université de Lorraine, 2013. Français. ⟨NNT : ⟩
Thèse
tel-00924743v1
|
||
|
Election Verifiability for Helios under Weaker Trust Assumptions[Research Report] RR-8555, INRIA. 2014, pp.20
Rapport
hal-01011294v2
|
||
|
Multi-precision computation of the complex error function2011
Pré-publication, Document de travail
hal-00580855v1
|
||
|
An O(M(n) log n) algorithm for the Jacobi symbol9th Algorithmic Number Theory Symposium - ANTS IX, Jul 2010, Nancy, France. pp.83-95, ⟨10.1007/978-3-642-14518-6_10⟩
Communication dans un congrès
inria-00447968v1
|
||
RSA : la fin des clés de 768 bitsTechniques de l'Ingénieur, 2011, IN131, ⟨10.51257/a-v1-in131⟩
Article dans une revue
hal-00641592v1
|
|||
Sieving in Function FieldsHenk C. A. van Tilborg and Sushil Jajodia. Encyclopedia of Cryptography and Security, Springer, pp.1205-1206, 2011, 978-1-4419-5905-8. ⟨10.1007/978-1-4419-5906-5_476⟩
Chapitre d'ouvrage
hal-00942003v1
|
|||
|
Optimal Eta pairing on supersingular genus-2 binary hyperelliptic curvesCryptographer's Track at the RSA Conference 2012 (CT-RSA 2012), Feb 2012, San Francisco, United States. pp.19
Communication dans un congrès
inria-00540002v1
|
||
|
Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiquesCryptographie et sécurité [cs.CR]. Université de Lorraine, 2012
HDR
tel-00765982v2
|
||
|
Accelerating Iterative SpMV for Discrete Logarithm Problem Using GPUsInternational Workshop on the Arithmetic of Finite Fields WAIFI 2014, Sep 2014, Gebze, Turkey
Communication dans un congrès
hal-00734975v4
|
||
The Great Trinomial HuntNotices of the American Mathematical Society, 2011, 58 (2), pp.233-239
Article dans une revue
inria-00443797v1
|
|||
|
Square root algorithms for the number field sieveArithmetic of Finite Fields -- WAIFI 2012, Jul 2012, Bochum, Germany. pp.208-224, ⟨10.1007/978-3-642-31662-3_15⟩
Communication dans un congrès
hal-00756838v1
|
||
Computing Discrete Logarithms in Small Characteristic Finite Fields in Quasi-Polynomial TimeThe 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France
Communication dans un congrès
hal-01276702v1
|
|||
|
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexityJournal of Symbolic Computation, 2011, 46 (4), pp.406-437. ⟨10.1016/j.jsc.2010.10.014⟩
Article dans une revue
inria-00596631v1
|
||
|
Polynomial Systems Solving by Fast Linear Algebra2013
Pré-publication, Document de travail
hal-00816724v2
|
||
|
Computing isogenies between Abelian VarietiesCompositio Mathematica, 2012, 148 (05), pp.1483--1515. ⟨10.1112/S0010437X12000243⟩
Article dans une revue
hal-00446062v3
|
||
|
Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curvesMathematics of Computation, 2015, 84 (294), pp.1953-1975 ⟨10.1090/S0025-5718-2014-02899-8⟩
Article dans une revue
hal-00578991v1
|
||
|
Cryptanalysis of ARMADILLO2Advances in cryptology - ASIACRYPT 2011, Dec 2011, Séoul, South Korea. pp.308-326, ⟨10.1007/978-3-642-25385-0⟩
Communication dans un congrès
inria-00619236v1
|
||
|
The Tower Number Field SieveASIACRYPT 2015, International Association of Cryptologic Research, Nov 2015, Auckland, New Zealand. pp.31-58
Communication dans un congrès
hal-01155635v1
|
||
|
Using Symmetries in the Index Calculus for Elliptic Curves Discrete LogarithmJournal of Cryptology, 2013, pp.1-40. ⟨10.1007/s00145-013-9158-5⟩
Article dans une revue
hal-00700555v3
|
||
|
Factorisation of RSA-704 with CADO-NFS2012
Pré-publication, Document de travail
hal-00760322v1
|
||
|
FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve2014
Pré-publication, Document de travail
hal-01002419v1
|
||
|
A low-area yet performant FPGA implementation of Shabal17th International Workshop on Selected Areas in Cryptography, SAC 2010, Aug 2010, Waterloo, Canada. pp.99-113, ⟨10.1007/978-3-642-19574-7_7⟩
Communication dans un congrès
inria-00498705v1
|
||
Distributed ElGamal à la Pedersen - Application to HeliosWPES 2013 - Proceedings of the 12th ACM workshop on privacy in the electronic society - 2013, Nov 2013, Berlin, Germany. pp.131-142, ⟨10.1145/2517840.2517852⟩
Communication dans un congrès
hal-00881076v1
|
|||
|
Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core ArchitecturesEuro-Par 2014 Parallel Processing, Aug 2014, Porto, Portugal
Communication dans un congrès
hal-00946895v3
|
||
|
Algorithms of discrete logarithm in finite fieldsCryptography and Security [cs.CR]. Université de Lorraine, 2013. English. ⟨NNT : ⟩
Thèse
tel-00925228v1
|
||
|
Sollya: an environment for the development of numerical codesThird International Congress on Mathematical Software - ICMS 2010, Sep 2010, Kobe, Japan. pp.28 -- 31, ⟨10.1007/978-3-642-15582-6_5⟩
Communication dans un congrès
hal-00761644v1
|
||
Explicit methods in number theory. Rational points and Diophantine equations.SMF, pp.xxi + 179, 2012, 978-2-85629-359-1/pbk
Ouvrages
hal-00932377v1
|