Skip to Main content Skip to Navigation


...
inria-00112838v1  Journal articles
Sylvain GellyOlivier Teytaud. Bayesian Networks: a Non-Frequentist Approach for Parametrization, and a more Accurate Structural Complexity Measure
Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2006
inria-00386299v1  Journal articles
Régis DupontAndreas EngeFrançois Morain. Building curves with arbitrary small MOV degree over finite prime fields
Journal of Cryptology, Springer Verlag, 2005, 18 (2), pp.79-89
inria-00386311v1  Journal articles
Régis DupontAndreas Enge. Provably Secure Non-Interactive Key Distribution Based on Pairings
Discrete Applied Mathematics, Elsevier, 2006, 154 (2), pp.270-276
inria-00177084v1  Journal articles
Sylvain GellyRémi Munos. L'Ordinateur, champion de go ?
Pour la science, Société Pour la Science 2007, 354, pp.28-35
inria-00537860v1  Conference papers
Benjamin Smith. Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
Eurocrypt 2008, International Association for Cryptologic Research, Apr 2008, Istanbul, Turkey. pp.163-180, ⟨10.1007/978-3-540-78967-3_10⟩
...
inria-00534726v1  Conference papers
Morgan Barbier. New Set of Codes for the Maximum-Likelihood Decoding Problem
Yet Another Conference on Cryptography, Oct 2010, Porquerolle, France
...
tel-00382535v1  Habilitation à diriger des recherches
Andreas Enge. Courbes Algébriques et Cryptologie
Mathématiques [math]. Université Paris-Diderot - Paris VII, 2007
...
tel-00547034v3  Theses
Luca de Feo. Fast Algorithms for Towers of Finite Fields and Isogenies
Mathematics [math]. Ecole Polytechnique X, 2010. English
...
inria-00547445v1  Conference papers
Daniel Augot. Problématique des bons codes sur le corps à deux éléments
Journées de la Société Mathémarique de France, Jun 2010, Paris, France
inria-00564022v1  Book sections
Daniel AugotMichael Stepanov. A note on the generalisation of the Guruswami-Sudan list decoding algorithm to Reed-Muller codes
Massimiliano Sala and Teo Mora and Ludovic Perret and Shojiro Sakata and Carlo Traverso. Gröbner Bases, Coding, and Cryptography, 2, Springer, pp.395-398, 2009, ⟨10.1007/978-3-540-93806-4_27⟩
...
inria-00543322v1  Conference papers
Daniel Augot. Les codes algébriques principaux et leur décodage
Journées Nationales de Calcul Formel, Jean-Guillaume Dumas, Grégoire Lecerf, Delphine Boucher et Thomas Cluzeau, May 2010, Luminy, France. pp.31-74
...
hal-00643774v1  Conference papers
Frederik ArmknechtDaniel AugotLudovic PerretAhmad-Reza Sadeghi. On Constructing Homomorphic Encryption Schemes from Coding Theory
13th IMA International Conference on Cryptography and Coding, Institute of Mathematics and its Applications (IMA), Dec 2011, Oxford, United Kingdom. pp.23-40, ⟨10.1007/978-3-642-25516-8_3⟩
...
inria-00633205v1  Journal articles
Alexander ZehChristian GentnerDaniel Augot. An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2011, 57, pp.5946-5959. ⟨10.1109/TIT.2011.2162160⟩
...
hal-00643794v1  Conference papers
Daniel AugotMorgan BarbierAlain Couvreur. List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound
IEEE Information Theory Workshop, Oct 2011, Paraty, Brazil. pp.229 - 233, ⟨10.1109/ITW.2011.6089384⟩
...
hal-00113594v1  Book sections
Stéphane LallichOlivier TeytaudElie Prudhomme. Association rule interestingness: measure and statistical validation
Guillet, Hamilton. Quality measures in data mining, Springer, pp.25, 2006
hal-00505799v1  Journal articles
Luca de FeoÉric Schost. Fast Arithmetics in Artin-Schreier Towers over Finite Fields
Journal of Symbolic Computation, Elsevier, 2012, 47 (7), pp.771-792. ⟨10.1016/j.jsc.2011.12.008⟩
...
inria-00514830v1  Journal articles
Pierrick GaudryNicolas Gürel. Counting points in medium characteristic using Kedlaya's algorithm
Experimental Mathematics, Taylor & Francis, 2003, 12, pp.395-402
...
hal-00175627v1  Conference papers
Cyril FurtlehnerJean-Marc LasgouttesArnaud de la Fortelle. A Belief Propagation Approach to Traffic Prediction using Probe Vehicles
10th International IEEE Conference on Intelligent Transportation Systems, Sep 2007, Seattle, United States. pp. 1022-1027
...
hal-00175628v1  Conference papers
Cyril FurtlehnerJean-Marc Lasgouttes. A queueing theory approach for a multi-speed exclusion process.
Traffic and Granular Flow '07, Jun 2007, Orsay, France. pp.unknown yet
...
pastel-00677421v1  Theses
Morgan Barbier. Décodage en liste et application à la sécurité de l'information
Cryptographie et sécurité [cs.CR]. Ecole Polytechnique X, 2011. Français
inria-00386309v1  Journal articles
Andreas EngeReinhard Schertz. Modular Curves of Composite Level
Acta Arithmetica, Instytut Matematyczny PAN, 2005, 118 (2), pp.129-141
inria-00000626v1  Book sections
Pierrick Gaudry. Chapter 7: Hyperelliptic curves and the HCDLP
I. Blake and G. Seroussi and N. Smart. Advances in Elliptic Curve Cryptography, 317 (317), Cambridge University Press, 2005, London Mathematical Society Lecture Note Series