Nombre de documents

70

Publications


Article dans une revue14 documents

  • Guilherme Perin, Laurent Imbert, Philippe Maurine, Lionel Torres. Vertical and horizontal correlation attacks on RNS-based exponentiations. Journal of Cryptographic Engineering, Springer, 2015, 5 (3), pp.171-185. <10.1007/s13389-015-0095-0>. <lirmm-01269799>
  • Filippo Disanto, Laurent Imbert, Fabrice Philippe. On the maximal weight of (p,q)-ary chain partitions with bounded parts. Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2014, 14, pp.A37. <http://www.integers-ejcnt.org/vol14.html>. <lirmm-01104898>
  • Laurent Imbert, Michael Jacobson Jr. Empirical optimization of divisor arithmetic on hyperelliptic curves over $\mathbf{F}_{2^m}$. Advances in Mathematics of Communications, AIMS, 2013, 7 (4), pp.485-502. <10.3934/amc.2013.7.485>. <lirmm-00870376>
  • Laurent Imbert, Mathieu Gaudin, Danielle Libong, David Touboul, Sonia Abreu, et al.. Comparison of electrospray ionization, atmospheric pressure chemical ionization and atmospheric pressure photoionization for a lipidomic analysis of Leishmania donovani.. Journal of Chromatography A, Elsevier, 2012, 1242, pp.75-83. <10.1016/j.chroma.2012.04.035>. <hal-00705293>
  • Mathieu Gaudin, Laurent Imbert, Danielle Libong, Pierre Chaminade, Alain Brunelle, et al.. Atmospheric pressure photoionization as a powerful tool for large-scale lipidomic studies.. Journal of The American Society for Mass Spectrometry, Springer Verlag (Germany), 2012, 23 (5), pp.869-79. <10.1007/s13361-012-0341-y>. <hal-00690894>
  • Jithra Adikari, Vassil Dimitrov, Laurent Imbert. Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.254-265. <lirmm-00595207>
  • Laurent Imbert, Fabrice Philippe. Strictly Chained (p, q)-ary Partitions. Contributions to Discrete Mathematics, University of Calgary, 2010, 5 (2), pp.119-136. <lirmm-00595209>
  • Laurent Imbert, Michael Jacobson Jr, Arthur Schmidt. Fast Ideal Cubing in Quadratic Number and Function Fields. Advances in Mathematics of Communications, AIMS, 2010, 4 (2), pp.237-260. <10.3934/amc.2010.4.237>. <lirmm-00484731>
  • Valerie Berthe, Laurent Imbert. Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (1), pp.153-172. <lirmm-00374066>
  • Vassil Dimitrov, Laurent Imbert, Pradeep Mishra. The Double-Base Number System and its Application to Elliptic Curve Cryptography. Mathematics of Computation, American Mathematical Society, 2008, 77 (262), pp.1075-1104. <lirmm-00341742>
  • Ryan Glabb, Laurent Imbert, Graham Jullien, Arnaud Tisserand, Nicolas Veyrat-Charvillon. Multi-Mode Operator for SHA-2 Hash Functions. Journal of Systems Architecture, Elsevier, 2007, Special Issue on Embedded Hardware for Cryptosystems, 52 (2-3), pp.127-138. <10.1016/j.sysarc.2006.09.006>. <lirmm-00126262>
  • Jean-Claude Bajard, Laurent Imbert, Christophe Negre. Arithmetic Operations in Finite Fields of Medium Prime Characteristic using the Lagrange Representation. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2006, 55 (9), pp.1167-1177. <lirmm-00102865>
  • Jean-Claude Bajard, Laurent Imbert. A Full RNS Implementation of RSA. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2004, 53 (6), pp.769-774. <lirmm-00108553>
  • Laurent Imbert, V.S. Dimitrov, Graham A. Jullien. Fault-Tolerant Computations over Replicated Finite Rings. IEEE Transactions on Circuits and Systems Part 1 Fundamental Theory and Applications, Institute of Electrical and Electronics Engineers (IEEE), 2003, 50 (7), pp.858-864. <10.1109/TCSI.2003.814085>. <lirmm-00269574>

Communication dans un congrès30 documents

  • Laurent Imbert. Randomizing Scalar Multiplication using Exact Covering Systems of Congruences. Explicit Methods for Abelian Varieties: Kick-off Workshop, May 2015, Calgary, Canada. 2015, <https://www.pims.math.ca/scientific-event/150525-emavkw>. <lirmm-01340683>
  • Guilherme Perin, Laurent Imbert, Lionel Torres, Philippe Maurine. Attacking Randomized Exponentiations Using Unsupervised Learning. COSADE: Constructive Side-Channel Analysis and Secure Design, Apr 2014, Paris, France. COSADE'2014: 5th International Workshop on Constructive Side-Channel Analysis and Secure Design, LNCS (8622), pp.144-160, 2014, Constructive Side-Channel Analysis and Secure Design. <10.1007/978-3-319-10175-0_11>. <lirmm-01096039>
  • Guilherme Perin, Laurent Imbert, Lionel Torres, Philippe Maurine. Electromagnetic Analysis on RSA Algorithm Based on RNS. DSD: Digital System Design, Sep 2013, Santander, Spain. IEEE, DSD'2013: 16th Euromicro Conference on Digital System Design, pp.345-352, 2013, Digital System Design. <10.1109/DSD.2013.44>. <lirmm-00861215>
  • Pascal Giorgi, Laurent Imbert, Thomas Izard. Parallel modular multiplication on multi-core processors. IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, Texas, United States. pp.135-142, 2013. <hal-00805242>
  • Guilherme Perin, Laurent Imbert, Lionel Torres, Philippe Maurine. Practical Analysis of RSA Countermeasures Against Side-Channel Electromagnetic Attacks. CARDIS: Smart Card Research and Advanced Application Conference, Nov 2013, Berlin, Germany. Springer, CARDIS'2013: 12th Smart Card Research and Advanced Application Conference, LNCS, pp.200-215, 2013. <lirmm-01096070>
  • Pascal Giorgi, Laurent Imbert, Thomas Izard. Optimizing Elliptic Curve Scalar Multiplication for Small Scalars. Mathematics for Signal and Information Processing, 2009, San Diego, CA, United States. pp.74440N, 2009, Proceeding of SPIE. <http://spie.org/x648.html?product_id=830092&origin_id=x648>. <10.1117/12.827689>. <lirmm-00424282>
  • Laurent Imbert. Strictly Chained (p,q)-ary Partitions. Alberta Number Theory Day, 2009, Calgary, Canada. 2009, <http://math.ucalgary.ca/~mgreenbe/ANTD.html>. <lirmm-00387809>
  • Pascal Ferraro, Pierre Hanna, Laurent Imbert, Thomas Izard. Accelerating Query-by-Humming on GPU. ISMIR: International Society for Music Information Retrieval Conference, Oct 2009, Kobe, Japan. IEEE, 2009, 10th International Society for Music Information Retrieval Conference. <hal-00407932>
  • Laurent Imbert, Michael Jacobson Jr, Arthur Schmidt. Fast ideal cubing in quadratic number and function fields. CHiLE: Conference on Hyperelliptic curves, discrete Logarithms, Encryption, etc., 2009, Frutillar, Chile. 2009, <http://inst-mat.utalca.cl/chile2009/>. <lirmm-00430686>
  • Jithra Adikari, Vassil Dimitrov, Laurent Imbert. Hybrid binary-ternary joint sparse form and its application in elliptic curve cryptography. ARITH'2009: 19th Symposium on Computer Arithmetic, 2009, Portland, Oregon, United States. IEEE, pp.076-082, 2009, <http://www.ac.usc.es/arith19/>. <lirmm-00430693>
  • Pascal Ferraro, Pierre Hanna, Laurent Imbert, Thomas Izard. Accelerating Query-by-Humming on GPU. ISMIR'2009: 10th International Society for Music Information Retrieval Conference, Oct 2009, Kobe, Japan. pp.279-284, 2009. <lirmm-00595214>
  • Jean-Claude Bajard, Laurent Imbert, Thomas Plantard. Improving Euclidean Division and Modular Reduction for Some Classes of Divisors. 37th IEEE Asilomar Conference on SignalsSystemsand Computers, Asilomar, CA (USA), pp. 2218-2221, 2003. <lirmm-00269572>
  • Christophe Doche, Laurent Imbert. The Double-Base Number System in Elliptic Curve Cryptography. 42nd Asilomar Conference on Signals, Systems and Computers, Oct 2008, Pacific Grove, CA, United States. IEEE, pp.777-780, 2008, <http://www.asilomarssc.org/>. <lirmm-00374045>
  • Laurent Imbert, Agostinho Peirera, Arnaud Tisserand. A Library for Prototyping the Computer Arithmetic Level in Elliptic Curve Cryptography. Advanced Signal Processing Algorithms, Architectures and Implementations XVII, Aug 2007, San Diego, California, United States. SPIE, 6697, pp.1-9 (66970N), 2007, <10.1117/12.733652>. <lirmm-00153369>
  • Vassil Dimitrov, Laurent Imbert, Andrew Zakaluzny. Multiplication by a Constant is Sublinear. ARITH-18: 18th IEEE Symposium on Computer Arithmetic, Jun 2007, Montpellier, France, IEEE Computer Society, pp.261-268, 2007. <lirmm-00158322>
  • Christophe Doche, Laurent Imbert. Extended Double-Base Number System with Applications to Elliptic Curve Cryptography. INDOCRYPT'06: Progress in Cryptology, Dec 2006, Kolkata, India, Springer, pp.335-348, 2006, LNCS. <lirmm-00125442>
  • Ryan Glabb, Laurent Imbert, Graham Jullien, Arnaud Tisserand, Nicolas Veyrat-Charvillon. Multi-mode Operator for SHA-2 Hash Functions. ERSA'06: International Conference on Engineering of Reconfigurable Systems and Algorithms, Jun 2006, Las Vegas, Nevada, United States. pp.207-210, 2006. <lirmm-00125521>
  • Vassil Dimitrov, Laurent Imbert, Andrew Zakaluzny. Sublinear constant multiplication algorithms. Advanced Signal Processing Algorithms, Architectures, and Implementations XVI, 2006, SPIE, 6313, pp.631305, 2006, Proceedings of SPIE. <10.1117/12.680289>. <lirmm-00135824>
  • I. Steiner, P. Chan, Laurent Imbert, A. Jullien G., S. Dimitrov V., et al.. A Fault-Tolerant Modulus Replication Complex FIR Filter. ASAP'05: 16th IEEE International Conference on Application-Specific SystemsArchitecture Processors, Jul 2005, Samos (Greece), IEEE, pp.387-392, 2005. <lirmm-00106442>
  • Jean-Claude Bajard, Laurent Imbert, A. Jullien G., C. Williams H.. A CRT-Based Montgomery Multiplication for Finite Fields of Small Characteristic. IMACS'05 : World Congress: Scientific Computation, Applied Mathematics and Simulation, Jul 2005, Paris (France), pp.CDROM, 2005. <lirmm-00106455>
  • Jean-Claude Bajard, Laurent Imbert, G.A. Jullien. Parallel Montgomery Multiplication in GF(2^k) Using Trinomial Residue Arithmetic. ARITH'17: IEEE Symposium on Computer Arithmetic, Jun 2005, Cape Cod, Massachusetts (USA), IEEE, pp.164-171, 2005. <lirmm-00106024>
  • V.S. Dimitrov, Laurent Imbert, P.K. Mishra. Efficient and Secure Elliptic Curve Point Multiplication using Double-Base Chains. ASIACRYPT '05, Dec 2005, Chennai (India), pp.59-78, 2005, Lecture Notes in Computer Science. <lirmm-00106030>
  • Jean-Claude Bajard, Laurent Imbert, Thomas Plantard. Arithmetic Operations in the Polynomial Modular Number System. ARITH'05: 17th IEEE Symposium on Computer Arithmetic, 2005, USA, IEEE computer society, pp.206-213, 2005, <http://arith.polito.it/>. <lirmm-00387051>
  • Jean-Claude Bajard, Laurent Imbert, Thomas Plantard. Modular Number Systems: Beyond the Mersenne Family. SAC'04: 11th International Workshop on Selected Areas in Cryptography, Aug 2005, University of Waterloo, Ontario (Canada), Springer Verlag, pp.159-169, 2005, Lecture Notes in Computer Science. <lirmm-00105957>
  • Jean-Claude Bajard, Laurent Imbert, Pierre-Yvan Liardet, Y. Teglia. Leak Resistant Arithmetic. CHES'04: Cryptographic Hardware and Embedded Systems, Aug 2004, Boston, MA, (USA), Springer Verlag, pp.62-75, 2004, Lecture Notes in Computer Science. <lirmm-00108863>
  • P. Chan, G.A. Jullien, Laurent Imbert, V.S. Dimitrov, G.H. Mcgibney. Fault-Tolerant Computations Within Complex FIR Filters. SIPS'04 : IEEE Workshop on Signal Processing SystemsDesign and Implementation, Oct 2004, Austin, Texas (USA), IEEE, pp.316-320, 2004. <lirmm-00108784>
  • Valerie Berthe, Laurent Imbert. On Converting Numbers to the Double-Base Number System. SPIE'04: Advanced Signal Processing AlgorithmsArchitectures and Implementations XIV, Aug 2004, Denver, Colorado (USA), SPIE, pp.70-78, 2004, SPIE. <lirmm-00108786>
  • Jean-Claude Bajard, Laurent Imbert, Christophe Negre, Thomas Plantard. Efficient Multiplication in GF (p^k) for Elliptic Curve Cryptography. Bajard J.C., Schulte M. ARITH-16'03: IEEE Symposium on Computer Arithmetic, Jun 2003, Santiago de Compostela, Spain. pp.181-187, 2003. <lirmm-00269538>
  • Jean-Luc Beuchat, Laurent Imbert, Arnaud Tisserand. Comparison of Modular Multipliers on FPGAs. Advanced Signal Processing Algorithms, Architectures, and Implementations XVIII, Aug 2003, San Diego, United States. 7074, pp.490-498, 2003, Proc. SPIE. <lirmm-00269573>
  • Jean-Claude Bajard, Laurent Imbert, Christophe Negre. Modular Multiplication in GF (p^k) Using Lagrange Representation. Springer. IndoCryp: International Cryptology Conference in India, 2002, Hyderabad, India. pp.275-284, 2002, Lecture Notes in Computer Science. <lirmm-00268466>

Chapitre d'ouvrage1 document

  • Laurent Imbert. Arithmétique Multiprecision. Traité IC2 (série Informatique et systèmes d'information)Calcul et Arithmétique des Ordinateurs, Hermes Sciences, pp.155-180, 2004, 2-7462-0861-X. <lirmm-00109153>

Pré-publication, Document de travail2 documents

  • Eleonora Guerrini, Laurent Imbert, Théo Winterhalter. Randomizing scalar multiplication using exact covering systems of congruences. 2015. <lirmm-01340672>
  • Filippo Disanto, Laurent Imbert, Fabrice Philippe. On the maximal weight of $(p,q)$-ary chain partitions with bounded parts. 2012. <lirmm-00815458>

Rapport22 documents

  • Laurent Imbert, Michael Jacobson. Empirical optimization of divisor arithmetic on hyperelliptic curves over $\mathbb{F}_{2m}$. RR-13008, 2012, pp.18. <lirmm-00815484>
  • Pascal Giorgi, Laurent Imbert, Thomas Izard. Multipartite Modular Multiplication. RR-11024, 2011, pp.25. <lirmm-00618437>
  • Laurent Imbert, Fabrice Philippe. Strictly Chained (p,q)-Ary Partitions. [Research Report] RR-09013, Lirmm. 2009. <lirmm-00387237>
  • C. Doche, Laurent Imbert. Extended Double-Base Number System with Applications to ECC. 06049, 2006. <lirmm-00102875>
  • V. Dimitrov, Laurent Imbert, A. Zakaluzny. Sublinear Constant Multiplication Algorithms. 06042, 2006. <lirmm-00102864>
  • V. Dimitrov, Laurent Imbert, P.K. Mishra. The Double-Base Number System and its Application to Elliptic Curve Cryptography. 06032, 2006. <lirmm-00102810>
  • V.S. Dimitrov, Laurent Imbert, P.K. Mishra. Fast Elliptic Curve Point Multiplication using Double-Base Chains. 05022, 2005. <lirmm-00106624>
  • V.S. Dimitrov, Laurent Imbert, P.K. Mishra. An Efficient and Secure Elliptic Curve Point Multiplication using Double-Base Chains. 05037, 2005. <lirmm-00106638>
  • Jean-Claude Bajard, Laurent Imbert, Christophe Negre. Arithmetic Operations in Finite Fields of Medium Prime Characteristic for Elliptic Curve Cryptography. 05028, 2005. <lirmm-00106633>
  • Jean-Claude Bajard, Laurent Imbert, Thomas Plantard. Arithmetic Operations in the Polynomial Modular Number System. 04030, 2004, 26 p. <lirmm-00109201>
  • Jean-Claude Bajard, Laurent Imbert, G.A. Jullien, Thomas Plantard. Fast Modular Reduction for a Large Class of Moduli. 04007, 2004. <lirmm-00109210>
  • P. Chan, G.A. Jullien, Laurent Imbert, V.S. Dimitrov, G. Mcgibney. Fault-Tolerant Computations Within Complex FIR Filters. 04016, 2004. <lirmm-00109222>
  • Jean-Claude Bajard, Laurent Imbert, Thomas Plantard. Modular Number Systems: Beyond the Mersenne Family. [Research Report] 04006, LIRMM. 2004. <lirmm-00109208>
  • Jean-Claude Bajard, Laurent Imbert, Pierre-Yvan Liardet. Leak Resistant Arithmetic. 03021, 2003, pp.P nd. <lirmm-00191922>
  • Jean-Claude Bajard, Laurent Imbert, Pierre-Yvan Liardet. Leak Resistant Arithmetic. 03021, 2003, pp.P nd. <lirmm-00269571>
  • Jean-Claude Bajard, Laurent Imbert, Pierre-Yvan Liardet. Leak Resistant Arithmetic. 03021, 2003. <lirmm-00269442>
  • Laurent Imbert, Jean-Claude Bajard. A Full RNS Implementation of RSA. 02068, 2002. <lirmm-00090366>
  • Jean-Claude Bajard, Laurent Imbert, Christophe Negre. Modular Multiplication in GF (p^k) Using Lagrange Representation. 02131, 2002. <lirmm-00090350>
  • Laurent Imbert, Jean-Claude Bajard. An Optimised Implementation of RSA in the Residue Number System. 02130, 2002, pp.P nd. <lirmm-00268425>
  • Laurent Imbert, V.S. Dimitrov, G.A. Jullien. Fault-Tolerant Computations Over Finite Rings with Applications in Digital Signal Processing. 02049, 2002. <lirmm-00268426>
  • Laurent Imbert, Jean-Michel Muller, Fabien Rico. Radix-10 BKM Algorithm for Computing Transcendentals on Pocket Computers. [Research Report] RR-3754, INRIA. 1999. <inria-00072908>
  • Milos Ercegovac, Laurent Imbert, David Matula, Jean-Michel Muller, Guoheng Wei. Improving Goldschmidt Division, Square Root and Square Root Reciprocal. [Research Report] RR-3753, INRIA. 1999. <inria-00072909>

HDR1 document

  • Laurent Imbert. Arithmexotiques. Informatique [cs]. Université Montpellier II - Sciences et Techniques du Languedoc, 2008. <tel-00341744>