Design of a VLSI circuit for on-line evaluation of several elementary functions using their Taylor expansions. - Jean-Claude Bajard; Alain Guyot; Jean-Michel Muller; Ali Skaf (ASAP, 1993)

A VLSI circuit for on-line polynominal computing: Application to exponential, trigonometric and hyperbolic functions. - Ali Skaf; Jean-Claude Bajard; Alain Guyot; Jean-Michel Muller (VLSI, 1993)

Some Operators for On-Line Radix-2 Computations. - Jean-Claude Bajard; Jean Duprat; Sylvanus Kla; Jean-Michel Muller (J. Parallel Distributed Comput., 1994)

BKM: A New Hardware Algorithm for Complex Elementary Functions. - Jean-Claude Bajard; Sylvanus Kla; Jean-Michel Muller (IEEE Trans. Computers, 1994)

Introduction to the Special Issue: "Real Numbers and Computers". - Jean-Claude Bajard; Dominique Michelucci; Jean-Michel Moreau; Jean-Michel Muller (J. Univers. Comput. Sci., 1995)

Forword to the Special Issue on Real Numbers and Computers. - Jean-Claude Bajard; Christiane Frougny; Jean-Michel Muller; Gilles Villard (Theor. Comput. Sci., 1996)

An IWS Montgomery Modular Multiplication Algorithm. - Jean-Claude Bajard; Laurent-Stéphane Didier; Peter Kornerup (IEEE Symposium on Computer Arithmetic, 1997)

An RNS Montgomery Modular Multiplication Algorithm. - Jean-Claude Bajard; Laurent-Stéphane Didier; Peter Kornerup (IEEE Trans. Computers, 1998)

A New Euclidean Division Algorithm for Residue Number Systems. - Jean-Claude Bajard; Laurent-Stéphane Didier; Jean-Michel Muller (J. VLSI Signal Process., 1998)

Foreword: Real Numbers and Computers. - Jean-Claude Bajard; Christiane Frougny; Jean-Michel Muller (Theor. Comput. Sci., 1999)

Modular Multiplication and Base Extensions in Residue Number Systems. - Jean-Claude Bajard; Laurent-Stéphane Didier; Peter Kornerup (IEEE Symposium on Computer Arithmetic, 2001)

Modular Multiplication in GF(pk) Using Lagrange Representation. - Jean-Claude Bajard; Laurent Imbert; Christophe Nègre (INDOCRYPT, 2002)

Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. - Jean-Claude Bajard; Laurent Imbert; Christophe Nègre; Thomas Plantard (IEEE Symposium on Computer Arithmetic, 2003)

Preface. - Peter Kornerup; Jean-Claude Bajard; Christiane Frougny; Jean-Michel Muller (Theor. Comput. Sci., 2003)

Leak Resistant Arithmetic. - Jean-Claude Bajard; Laurent Imbert; Pierre-Yvan Liardet; Yannick Teglia (CHES, 2004)

Modular Number Systems: Beyond the Mersenne Family. - Jean-Claude Bajard; Laurent Imbert; Thomas Plantard (Selected Areas in Cryptography, 2004)

Parallel Montgomery Multiplication in GF(2k) using Trinomial Residue Arithmetic. - Jean-Claude Bajard; Laurent Imbert; Graham A. Jullien (IACR Cryptol. ePrint Arch., 2004)

A Full RNS Implementation of RSA. - Jean-Claude Bajard; Laurent Imbert (IEEE Trans. Computers, 2004)

Arithmetic Operations in the Polynomial Modular Number System. - Jean-Claude Bajard; Laurent Imbert; Thomas Plantard (IEEE Symposium on Computer Arithmetic, 2005)

A Leak Resistant Architecture Against Side Channel Attacks. - Daniel Mesquita; Benoît Badrignans; Lionel Torres; Gilles Sassatelli; Michel Robert; Jean-Claude Bajard; Fernando Gehm Moraes (FPL, 2006)

A Parallel and Secure Architecture for Asymmetric Cryptography. - Benoît Badrignans; Daniel Mesquita; Jean-Claude Bajard; Lionel Torres; Gilles Sassatelli; Michel Robert (ReCoSoC, 2006)

Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation. - Jean-Claude Bajard; Laurent Imbert; Christophe Nègre (IEEE Trans. Computers, 2006)

Selected RNS Bases for Modular Multiplication. - Jean-Claude Bajard; Marcelo E. Kaihara; Thomas Plantard (IEEE Symposium on Computer Arithmetic, 2009)

A Secure and Efficient Authenticated Diffie - Hellman Protocol. - Augustin P. Sarr; Philippe Elbaz-Vincent; Jean-Claude Bajard (IACR Cryptol. ePrint Arch., 2009)

Elliptic Curve point multiplication on GPUs. - Samuel Antao; Jean-Claude Bajard; Leonel Sousa (ASAP, 2010)

Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation. - Jean-Claude Bajard; Sylvain Duquesne; Milos D. Ercegovac (IACR Cryptol. ePrint Arch., 2010)

A New Security Model for Authenticated Key Agreement. - Augustin P. Sarr; Philippe Elbaz-Vincent; Jean-Claude Bajard (IACR Cryptol. ePrint Arch., 2010)

Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. - Jean-Claude Bajard; Christophe Nègre; Thomas Plantard (IEEE Trans. Computers, 2010)

A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing. - Filippo Gandino; Fabrizio Lamberti; Paolo Montuschi; Jean-Claude Bajard (IEEE Symposium on Computer Arithmetic, 2011)

RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures. - Samuel Antao; Jean-Claude Bajard; Leonel Sousa (Comput. J., 2012)

An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS. - Filippo Gandino; Fabrizio Lamberti; Gianluca Paravati; Jean-Claude Bajard; Paolo Montuschi (IEEE Trans. Computers, 2012)

Fault Detection in RNS Montgomery Modular Multiplication. - Jean-Claude Bajard; Julien Eynard; Filippo Gandino (IEEE Symposium on Computer Arithmetic, 2013)

Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols. - Jean-Claude Bajard; Julien Eynard; Nabil Merkiche; Thomas Plantard (ISIC, 2014)

Double Level Montgomery Cox-Rower Architecture, New Bounds. - Jean-Claude Bajard; Nabil Merkiche (IACR Cryptol. ePrint Arch., 2014)

RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure. - Jean-Claude Bajard; Julien Eynard; Nabil Merkiche; Thomas Plantard (ARITH, 2015)

Programmable RNS lattice-based parallel cryptographic decryption. - Paulo Martins 002; Leonel Sousa; Julien Eynard; Jean-Claude Bajard (ASAP, 2015)

Multi-fault Attack Detection for RNS Cryptographic Architecture. - Jean-Claude Bajard; Julien Eynard; Nabil Merkiche (ARITH, 2016)

A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Vincent Zucca (IACR Cryptol. ePrint Arch., 2016)

Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Paulo Martins 002; Leonel Sousa; Vincent Zucca (SAC, 2017)

Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes. - Jean-Claude Bajard; Julien Eynard; M. Anwar Hasan; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IACR Cryptol. ePrint Arch., 2017)

Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices. - Paulo Martins 002; Julien Eynard; Jean-Claude Bajard; Leonel Sousa (IEEE Trans. Computers, 2017)

Evaluation of Resilience of randomized RNS implementation. - Jérôme Courtois; Lokman A. Abbas-Turki; Jean-Claude Bajard (IACR Cryptol. ePrint Arch., 2018)

Montgomery reduction within the context of residue number system arithmetic. - Jean-Claude Bajard; Julien Eynard; Nabil Merkiche (J. Cryptogr. Eng., 2018)

HyPoRes: An Hybrid Representation System for ECC. - Paulo Martins 002; Jérémy Marrez; Jean-Claude Bajard; Leonel Sousa (ARITH, 2019)

An HPR variant of the FV scheme: Computationally Cheaper, Asymptotically Faster. - Jean-Claude Bajard; Julien Eynard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IACR Cryptol. ePrint Arch., 2019)

Note on the noise growth of the RNS variants of the BFV scheme. - Jean-Claude Bajard; Julien Eynard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IACR Cryptol. ePrint Arch., 2019)

Resilience of Randomized RNS Arithmetic with Respect to Side-Channel Leaks of Cryptographic Computation. - Jérôme Courtois; Lokman A. Abbas-Turki; Jean-Claude Bajard (IEEE Trans. Computers, 2019)

An asymptotically faster version of FV supported on HPR. - Jean-Claude Bajard; Julien Eynard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (ARITH, 2020)

Improving the Efficiency of SVM Classification With FHE. - Jean-Claude Bajard; Paulo Martins 002; Leonel Sousa; Vincent Zucca (IEEE Trans. Inf. Forensics Secur., 2020)

Generating Residue Number System Bases. - Jean-Claude Bajard; Kazuhide Fukushima; Shinsaku Kiyomoto; Thomas Plantard; Arnaud Sipasseuth; Willy Susilo (ARITH, 2021)

Montgomery-friendly primes and applications to cryptography. - Jean-Claude Bajard; Sylvain Duquesne (J. Cryptogr. Eng., 2021)

Generating Very Large RNS Bases. - Jean-Claude Bajard; Kazuhide Fukushima; Thomas Plantard; Arnaud Sipasseuth (IEEE Trans. Emerg. Top. Comput., 2022)

Fast verification and public key storage optimization for unstructured lattice-based signatures. - Jean-Claude Bajard; Kazuhide Fukushima; Thomas Plantard; Arnaud Sipasseuth (J. Cryptogr. Eng., 2023)

On Polynomial Modular Number Systems over $ mathbb{Z}/{p} mathbb{Z} $. - Jean-Claude Bajard; Jérémy Marrez; Thomas Plantard; Pascal Véron (Adv. Math. Commun., 2024)