Jean-Claude Bajard

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Arnaud Sipasseuth

> Home > Persons > Jean-Claude Bajard

Publications

2023
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/jce/BajardFPS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jce/BajardFPS23
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): 373-388 (2023)
2022
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/tetc/BajardFPS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tetc/BajardFPS22
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth:
Generating Very Large RNS Bases. IEEE Trans. Emerg. Top. Comput. 10(3): 1289-1301 (2022)
[c31]
- view
  authority control:
- export record
  dblp key:
  - conf/arith/BajardFPS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/arith/BajardFPS22
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth:
Generating Very Large RNS Bases. ARITH 2022: 102
2021
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/arith/BajardFKPSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/arith/BajardFKPSS21
Jean-Claude Bajard, Kazuhide Fukushima, Shinsaku Kiyomoto, Thomas Plantard, Arnaud Sipasseuth, Willy Susilo:
Generating Residue Number System Bases. ARITH 2021: 86-93

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.