![]() | ![]() |
| 2011 | ||
|---|---|---|
| 33 | Filippo Gandino, Fabrizio Lamberti, Paolo Montuschi, Jean-Claude Bajard: A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing. IEEE Symposium on Computer Arithmetic 2011: 195-204 | |
| 2010 | ||
| 32 | Samuel Antao, Jean-Claude Bajard, Leonel Sousa: Elliptic Curve point multiplication on GPUs. ASAP 2010: 192-199 | |
| 31 | Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard: A New Security Model for Authenticated Key Agreement. SCN 2010: 219-234 | |
| 30 | Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard: A New Security Model for Authenticated Key Agreement. IACR Cryptology ePrint Archive 2010: 237 (2010) | |
| 29 | Jean-Claude Bajard, Sylvain Duquesne, Milos D. Ercegovac: Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation. IACR Cryptology ePrint Archive 2010: 311 (2010) | |
| 28 | Jean-Claude Bajard, Christophe Nègre, Thomas Plantard: Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. IEEE Trans. Computers 59(12): 1585-1597 (2010) | |
| 2009 | ||
| 27 | Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard: A Secure and Efficient Authenticated Diffie-Hellman Protocol. EuroPKI 2009: 83-98 | |
| 26 | Jean-Claude Bajard, Marcelo E. Kaihara, Thomas Plantard: Selected RNS Bases for Modular Multiplication. IEEE Symposium on Computer Arithmetic 2009: 25-32 | |
| 25 | Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard: A Secure and Efficient Authenticated Diffie - Hellman Protocol. IACR Cryptology ePrint Archive 2009: 408 (2009) | |
| 2006 | ||
| 24 | Daniel Mesquita, Benoît Badrignans, Lionel Torres, Gilles Sassatelli, Michel Robert, Jean-Claude Bajard, Fernando Gehm Moraes: A Leak Resistant Architecture Against Side Channel Attacks. FPL 2006: 1-4 | |
| 23 | Benoît Badrignans, Daniel Mesquita, Jean-Claude Bajard, Lionel Torres, Gilles Sassatelli, Michel Robert: A Parallel and Secure Architecture for Asymmetric Cryptography. ReCoSoC 2006: 220-224 | |
| 22 | Jean-Claude Bajard, Laurent Imbert, Christophe Nègre: Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation. IEEE Trans. Computers 55(9): 1167-1177 (2006) | |
| 2005 | ||
| 21 | Jean-Claude Bajard, Laurent Imbert, Graham A. Jullien: Parallel Montgomery Multiplication in GF(2k) Using Trinomial Residue Arithmetic. IEEE Symposium on Computer Arithmetic 2005: 164-171 | |
| 20 | Jean-Claude Bajard, Laurent Imbert, Thomas Plantard: Arithmetic Operations in the Polynomial Modular Number System. IEEE Symposium on Computer Arithmetic 2005: 206-213 | |
| 2004 | ||
| 19 | Jean-Claude Bajard, Laurent Imbert, Pierre-Yvan Liardet, Yannick Teglia: Leak Resistant Arithmetic. CHES 2004: 62-75 | |
| 18 | Jean-Claude Bajard, Laurent Imbert, Thomas Plantard: Modular Number Systems: Beyond the Mersenne Family. Selected Areas in Cryptography 2004: 159-169 | |
| 17 | Jean-Claude Bajard, Laurent Imbert, Graham A. Jullien: Parallel Montgomery Multiplication in GF(2k) using Trinomial Residue Arithmetic. IACR Cryptology ePrint Archive 2004: 279 (2004) | |
| 16 | Jean-Claude Bajard, Laurent Imbert: A Full RNS Implementation of RSA. IEEE Trans. Computers 53(6): 769-774 (2004) | |
| 2003 | ||
| 15 | Jean-Claude Bajard, Laurent Imbert, Christophe Nègre, Thomas Plantard: Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. IEEE Symposium on Computer Arithmetic 2003: 181-187 | |
| 14 | Peter Kornerup, Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller: Preface. Theor. Comput. Sci. 291(2): 133-134 (2003) | |
| 2002 | ||
| 13 | Jean-Claude Bajard, Laurent Imbert, Christophe Nègre: Modular Multiplication in GF(pk) Using Lagrange Representation. INDOCRYPT 2002: 275-284 | |
| 2001 | ||
| 12 | Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup: Modular Multiplication and Base Extensions in Residue Number Systems. IEEE Symposium on Computer Arithmetic 2001: 59-65 | |
| 1999 | ||
| 11 | Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller: Foreword: Real Numbers and Computers. Theor. Comput. Sci. 210(1): 1-2 (1999) | |
| 1998 | ||
| 10 | Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup: An RNS Montgomery Modular Multiplication Algorithm. IEEE Trans. Computers 47(7): 766-776 (1998) | |
| 9 | Jean-Claude Bajard, Laurent-Stéphane Didier, Jean-Michel Muller: A New Euclidean Division Algorithm for Residue Number Systems. VLSI Signal Processing 19(2): 167-178 (1998) | |
| 1997 | ||
| 8 | Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup: An IWS Montgomery Modular Multiplication Algorithm. IEEE Symposium on Computer Arithmetic 1997: 234-239 | |
| 1996 | ||
| 7 | Jean-Claude Bajard, Laurent-Stéphane Didier, Jean-Michel Muller: A New Euclidean Division Algorithm For Residue Number Systems. ASAP 1996: 45-54 | |
| 6 | Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller, Gilles Villard: Forword to the Special Issue on Real Numbers and Computers. Theor. Comput. Sci. 162(1): 1-3 (1996) | |
| 1995 | ||
| 5 | Jean-Claude Bajard, Dominique Michelucci, Jean-Michel Moreau, Jean-Michel Muller: Introduction to the Special Issue: "Real Numbers and Computers". J. UCS 1(7): 436-438 (1995) | |
| 1994 | ||
| 4 | Jean-Claude Bajard, Sylvanus Kla, Jean-Michel Muller: BKM: A New Hardware Algorithm for Complex Elementary Functions. IEEE Trans. Computers 43(8): 955-963 (1994) | |
| 3 | Jean-Claude Bajard, Jean Duprat, Sylvanus Kla, Jean-Michel Muller: Some Operators for On-Line Radix-2 Computations. J. Parallel Distrib. Comput. 22(2): 336-345 (1994) | |
| 1993 | ||
| 2 | Jean-Claude Bajard, Sylvanus Kla, Jean-Michel Muller: BKM: A new hardware algorithm for complex elementary functions. IEEE Symposium on Computer Arithmetic 1993: 146-153 | |
| 1 | Ali Skaf, Jean-Claude Bajard, Alain Guyot, Jean-Michel Muller: A VLSI circuit for on-line polynominal computing: Application to exponential, trigonometric and hyperbolic functions. VLSI 1993: 93-100 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page