Jean-Claude Bajard

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 22

Top Topics

Integer Arithmetic

Svm Classification

Top Venues

IACR Cryptol. ePrint Arch.

J. Cryptogr. Eng.

Publications

Jean-Claude Bajard, Jérémy Marrez, Thomas Plantard, Pascal Véron
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $. Adv. Math. Commun. 18 (3) (2024)
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth
Fast verification and public key storage optimization for unstructured lattice-based signatures. J. Cryptogr. Eng. 13 (3) (2023)
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth
Generating Very Large RNS Bases. IEEE Trans. Emerg. Top. Comput. 10 (3) (2022)
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth
Generating Very Large RNS Bases. ARITH (2022)
Jean-Claude Bajard, Kazuhide Fukushima, Shinsaku Kiyomoto, Thomas Plantard, Arnaud Sipasseuth, Willy Susilo
Generating Residue Number System Bases. ARITH (2021)
Jean-Claude Bajard, Sylvain Duquesne
Montgomery-friendly primes and applications to cryptography. J. Cryptogr. Eng. 11 (4) (2021)
Jean-Claude Bajard, Jérémy Marrez, Thomas Plantard, Pascal Véron
On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$. CoRR (2020)
Jean-Claude Bajard, Sylvain Duquesne
Montgomery-friendly primes and applications to cryptography. IACR Cryptol. ePrint Arch. 2020 (2020)
Jean-Claude Bajard, Paulo Martins, Leonel Sousa, Vincent Zucca
Improving the Efficiency of SVM Classification With FHE. IEEE Trans. Inf. Forensics Secur. 15 (2020)
Jean-Claude Bajard, Julien Eynard, Paulo Martins, Leonel Sousa, Vincent Zucca
An asymptotically faster version of FV supported on HPR. ARITH (2020)
Jérôme Courtois, Lokman A. Abbas-Turki, Jean-Claude Bajard
Resilience of Randomized RNS Arithmetic with Respect to Side-Channel Leaks of Cryptographic Computation. IEEE Trans. Computers 68 (12) (2019)
Jean-Claude Bajard, Julien Eynard, Paulo Martins, Leonel Sousa, Vincent Zucca
Note on the noise growth of the RNS variants of the BFV scheme. IACR Cryptol. ePrint Arch. 2019 (2019)
Paulo Martins, Jérémy Marrez, Jean-Claude Bajard, Leonel Sousa
HyPoRes: An Hybrid Representation System for ECC. ARITH (2019)
Jean-Claude Bajard, Julien Eynard, Paulo Martins, Leonel Sousa, Vincent Zucca
An HPR variant of the FV scheme: Computationally Cheaper, Asymptotically Faster. IACR Cryptol. ePrint Arch. 2019 (2019)
Jérôme Courtois, Lokman A. Abbas-Turki, Jean-Claude Bajard
Evaluation of Resilience of randomized RNS implementation. IACR Cryptol. ePrint Arch. 2018 (2018)
Jean-Claude Bajard, Julien Eynard, Nabil Merkiche
Montgomery reduction within the context of residue number system arithmetic. J. Cryptogr. Eng. 8 (3) (2018)
Paulo Martins, Julien Eynard, Jean-Claude Bajard, Leonel Sousa
Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices. IEEE Trans. Computers 66 (12) (2017)
Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Paulo Martins, Leonel Sousa, Vincent Zucca
Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes. IACR Cryptol. ePrint Arch. 2017 (2017)
Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Paulo Martins, Leonel Sousa, Vincent Zucca
Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes. SAC (2017)
Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Vincent Zucca
A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes. IACR Cryptol. ePrint Arch. 2016 (2016)
Jean-Claude Bajard, Julien Eynard, M. Anwar Hasan, Vincent Zucca
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes. SAC (2016)
Jean-Claude Bajard, Julien Eynard, Nabil Merkiche
Multi-fault Attack Detection for RNS Cryptographic Architecture. ARITH (2016)
Paulo Martins, Leonel Sousa, Julien Eynard, Jean-Claude Bajard
Programmable RNS lattice-based parallel cryptographic decryption. ASAP (2015)
Jean-Claude Bajard, Julien Eynard, Nabil Merkiche, Thomas Plantard
RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure. ARITH (2015)
Jean-Claude Bajard, Nabil Merkiche
Double Level Montgomery Cox-Rower Architecture, New Bounds. CARDIS (2014)
Jean-Claude Bajard, Nabil Merkiche
Double Level Montgomery Cox-Rower Architecture, New Bounds. IACR Cryptol. ePrint Arch. 2014 (2014)
Jean-Claude Bajard, Julien Eynard, Nabil Merkiche, Thomas Plantard
Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols. ISIC (2014)
Jean-Claude Bajard, Julien Eynard, Filippo Gandino
Fault Detection in RNS Montgomery Modular Multiplication. IEEE Symposium on Computer Arithmetic (2013)
Filippo Gandino, Fabrizio Lamberti, Gianluca Paravati, Jean-Claude Bajard, Paolo Montuschi
An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS. IEEE Trans. Computers 61 (8) (2012)
Samuel Antao, Jean-Claude Bajard, Leonel Sousa
RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures. Comput. J. 55 (5) (2012)
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)
Jean-Claude Bajard, Christophe Nègre, Thomas Plantard
Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. IEEE Trans. Computers 59 (12) (2010)
Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard
A New Security Model for Authenticated Key Agreement. IACR Cryptol. ePrint Arch. 2010 (2010)
Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard
A New Security Model for Authenticated Key Agreement. SCN (2010)
Jean-Claude Bajard, Sylvain Duquesne, Milos D. Ercegovac
and RNS representation. IACR Cryptol. ePrint Arch. 2010 (2010)
Samuel Antao, Jean-Claude Bajard, Leonel Sousa
Elliptic Curve point multiplication on GPUs. ASAP (2010)
Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard
A Secure and Efficient Authenticated Diffie-Hellman Protocol. EuroPKI (2009)
Jean-Claude Bajard, Marcelo E. Kaihara, Thomas Plantard
Selected RNS Bases for Modular Multiplication. IEEE Symposium on Computer Arithmetic (2009)
Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Claude Bajard
A Secure and Efficient Authenticated Diffie - Hellman Protocol. IACR Cryptol. ePrint Arch. 2009 (2009)
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) (2006)
Benoît Badrignans, Daniel Mesquita, Jean-Claude Bajard, Lionel Torres, Gilles Sassatelli, Michel Robert
A Parallel and Secure Architecture for Asymmetric Cryptography. ReCoSoC (2006)
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)
Jean-Claude Bajard, Laurent Imbert, Graham A. Jullien
) Using Trinomial Residue Arithmetic. IEEE Symposium on Computer Arithmetic (2005)
Jean-Claude Bajard, Laurent Imbert, Thomas Plantard
Arithmetic Operations in the Polynomial Modular Number System. IEEE Symposium on Computer Arithmetic (2005)
Jean-Claude Bajard, Laurent Imbert, Thomas Plantard
Modular Number Systems: Beyond the Mersenne Family. Selected Areas in Cryptography (2004)
Jean-Claude Bajard, Laurent Imbert
A Full RNS Implementation of RSA. IEEE Trans. Computers 53 (6) (2004)
Jean-Claude Bajard, Laurent Imbert, Pierre-Yvan Liardet, Yannick Teglia
Leak Resistant Arithmetic. CHES (2004)
Jean-Claude Bajard, Laurent Imbert, Graham A. Jullien
) using Trinomial Residue Arithmetic. IACR Cryptol. ePrint Arch. 2004 (2004)
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)
Peter Kornerup, Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller
Preface. Theor. Comput. Sci. 291 (2) (2003)
Jean-Claude Bajard, Laurent Imbert, Christophe Nègre
) Using Lagrange Representation. INDOCRYPT (2002)
Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup
Modular Multiplication and Base Extensions in Residue Number Systems. IEEE Symposium on Computer Arithmetic (2001)
Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller
Foreword: Real Numbers and Computers. Theor. Comput. Sci. 210 (1) (1999)
Jean-Claude Bajard, Laurent-Stéphane Didier, Jean-Michel Muller
A New Euclidean Division Algorithm for Residue Number Systems. J. VLSI Signal Process. 19 (2) (1998)
Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup
An RNS Montgomery Modular Multiplication Algorithm. IEEE Trans. Computers 47 (7) (1998)
Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup
An IWS Montgomery Modular Multiplication Algorithm. IEEE Symposium on Computer Arithmetic (1997)
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) (1996)
Jean-Claude Bajard, Laurent-Stéphane Didier, Jean-Michel Muller
A New Euclidean Division Algorithm For Residue Number Systems. ASAP (1996)
Jean-Claude Bajard, Dominique Michelucci, Jean-Michel Moreau, Jean-Michel Muller
Introduction to the Special Issue: "Real Numbers and Computers". J. Univers. Comput. Sci. 1 (7) (1995)
Jean-Claude Bajard, Sylvanus Kla, Jean-Michel Muller
BKM: A New Hardware Algorithm for Complex Elementary Functions. IEEE Trans. Computers 43 (8) (1994)
Jean-Claude Bajard, Jean Duprat, Sylvanus Kla, Jean-Michel Muller
Some Operators for On-Line Radix-2 Computations. J. Parallel Distributed Comput. 22 (2) (1994)
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)
Jean-Claude Bajard, Sylvanus Kla, Jean-Michel Muller
BKM: A new hardware algorithm for complex elementary functions. IEEE Symposium on Computer Arithmetic (1993)
Jean-Claude Bajard, Alain Guyot, Jean-Michel Muller, Ali Skaf
Design of a VLSI circuit for on-line evaluation of several elementary functions using their Taylor expansions. ASAP (1993)