Jean-Claude Bajard

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

24h-index2.0kcitations108works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Residue Arithmetic(66), Coding theory and cryptography(47), Cryptography and Data Security(44), Cryptographic Implementations and Security(23), Chaos-based Image/Signal Encryption(12)

Publications108 total

Fast verification and public key storage optimization for unstructured lattice-based signatures
Journal of Cryptographic Engineering·2023· 3 citedOpen Access
Generating Very Large RNS Bases
2022
Generating Very Large RNS Bases
IEEE Transactions on Emerging Topics in Computing·2022· 1 citedOpen Access
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $
Advances in Mathematics of Communications·2022· 4 citedOpen Access
Generating Residue Number System Bases
2021· 3 citedOpen Access
Montgomery-friendly primes and applications to cryptography
Journal of Cryptographic Engineering·2021· 5 citedOpen Access
Arithmetic of finite fields: 8th International Workshop, WAIFI 2020, Rennes, France, July 6–8, 2020, Revised selected and invited papers
2021
Arithmetic of Finite Fields
Lecture notes in computer science·2021· 115 cited
An HPR variant of the FV scheme: Computationally Cheaper, Asymptotically Faster
IACR Cryptology ePrint Archive·2020· 2 citedOpen Access
An asymptotically faster version of FV supported on HPR
2020Open Access
Improving the Efficiency of SVM Classification With FHE
IEEE Transactions on Information Forensics and Security·2019· 26 cited
Resilience of Randomized RNS Arithmetic with Respect to Side-Channel Leaks of Cryptographic Computation
IEEE Transactions on Computers·2019· 11 citedOpen Access
HyPoRes: An Hybrid Representation System for ECC
2019· 2 citedOpen Access
Note on the noise growth of the RNS variants of the BFV scheme.
IACR Cryptology ePrint Archive·2019· 11 cited
Evaluation of Resilience of randomized RNS implementation.
IACR Cryptology ePrint Archive·2018· 1 cited
Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes
Lecture notes in computer science·2017· 4 citedOpen Access
Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices
IEEE Transactions on Computers·2017· 5 citedOpen Access
Montgomery reduction within the context of residue number system arithmetic
Journal of Cryptographic Engineering·2017· 32 citedOpen Access
A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes
Lecture notes in computer science·2017· 220 citedOpen Access
RNS Approach in Lattice-Based Cryptography
2017
page 1 of 6Next →

Frequent Co-authors

Laurent Imbert(10), Thomas Plantard(9), Julien Eynard(7), Jean‐Michel Muller(6), Laurent-Stéphane Didier(5), Leonel Sousa(5), Nabil Merkiche(5), Sylvain Duquesne(4), Vincent Zucca(3), Peter Kornerup(3), Filippo Gandino(3), S. Kla(3), Nicolas Méloni(3), Paulo Martins(3), Christophe Négre(3), M.D. Ercegovac(3), G. Blondiaux(3), Augustin P. Sarr(2), Philippe Elbaz–Vincent(2), Samuel Antão(2)