Jean-Claude Bajard

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