Nombre de documents


CV de Sylvain Duquesne

Article dans une revue6 documents

  • Sylvain Duquesne, Loubna Ghammam. Memory-saving computation of the pairing final exponentiation on BN curves. Groups. Complexity. Cryptology, 2016, 8 (1), pp.75-90. <10.1515/gcc-2016-0006>. <hal-01317398>
  • Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa. Efficient computation of pairings on Jacobi quartic elliptic curves. Journal of Mathematical Cryptology, De Gruyter, 2014, 8 (4), pp.331-362. <10.1515/jmc-2013-0033>. <hal-01095359>
  • Sylvain Duquesne. RNS arithmetic in Fpk and application to fast pairing computation. Journal of Mathematical Cryptology, De Gruyter, 2011, 5 (1), pp.51-88. <hal-00687220>
  • Sylvain Duquesne. Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2. Mathematics in Computer Science, Springer, 2010, 3 (2), pp.173-183. <hal-00521513>
  • Sylvain Duquesne. Elliptic Curves Associated with Simplest Quartic Fields. Journal de Théorie des Nombres de Bordeaux, Société Arithmétique de Bordeaux, 2007, 19 (1), pp.81-100. <lirmm-00145846>
  • Sylvain Duquesne. Improving the Arithmetic of Elliptic Curves in the Jacobi Model. Information Processing Letters, Elsevier, 2007, 0, pp.5. <10.1016/j.ipl.2007.05.012>. <lirmm-00145805>

Chapitre d'ouvrage2 documents

  • R. Cheung, J. Fan, Nicolas Guillermin, Ingrid Verbauwhede, G. Yao, et al.. FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction. Bart Preneel. Cryptographic Hardware and Embedded Systems. CHES 2011: 13th International Workshop, Nara, Japan, September 28 - October 1, 2011, Proceedings, Springer, pp.421-441, 2011, Lecture Notes in Computer Science 6917, 9783642239502. <hal-00745016>
  • Sylvain Duquesne. Rational Points on Higher -Genus curves. Number Theory Volume II : Analytic and Modern Tools, pp.441-462, 2007, 978-0-387-49893-5. <lirmm-00182681>

Communication dans un congrès3 documents

  • Sylvain Duquesne, Emmanuel Fouotsa. Tate Pairing Computation on Jacobi's Elliptic Curves. Michel Abdalla, Tanja Lange. Pairing-Based Cryptography-Pairing 2012, May 2012, Cologne, Germany. Springer, 7708, pp.254-269, 2013, Lecture Notes in Computer Science, vol. 7708. <10.1007/978-3-642-36334-4_17>. <hal-00832363>
  • Sylvain Duquesne. Montgomery scalar multiplication for genus 2 curves. Arithmetic of finite fields, Jul 2008, Siena, Italy. Springer, 5130, pp.174-188, 2008, Lecture notes in computer science. <hal-00457826>
  • Jean-Claude Bajard, Sylvain Duquesne, Milos Ercegovac, Nicolas Meloni. Residue systems efficiency for modular products summation: Application to Elliptic Curves Cryptography. Proceedings of SPIE : Advanced Signal Processing Algorithms, Architectures, and Implementations XVI, Aug 2006, 6313, pp.0, 2006. <lirmm-00146450>

Rapport1 document

  • Jean-Claude Bajard, Sylvain Duquesne, Nicolas Méloni. Combining Montgomery Ladder for Elliptic Curves Defined over $\F_p$ and RNS Representation. [Research Report] 06041, LIR. 2006. <lirmm-00102859>