Claude Gravel

Dr. Claude Gravel

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 January 2019 in Entropy
Verified
Journal Article
Open access
PDF file
GBGilles Brassard
Gilles Brassard
LDLuc Devroye
Luc Devroye
CGClaude Gravel
Claude Gravel
We show how to sample exactly discrete probability distributions whose defining parameters are distributed among remote parties. For this purpose, von Neumann’s rejection algorithm is turned into a distributed sampling communication protocol. We study the expected number of bits communicated among the parties and also exhibit a trade-off between the number of rounds of the rejection algorithm and the number of bits transmitted in the initial phase. Finally, we apply remote sampling to the simulation of quantum entanglement in its essentially most general form possible, when an arbitrary finite number m of parties share systems of arbitrary finite dimensions on which they apply arbitrary measurements (not restricted to being projective measurements, but restricted to finitely many possible outcomes). In case the dimension of the systems and the number of possible outcomes per party are bounded by a constant, it suffices to communicate an expected O ( m 2 ) bits in order to simulate exactly the outcomes that these measurements would have produced on those systems.

19 July 2019 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
CGClaude Gravel
Claude Gravel
DPDaniel Panario
Daniel Panario
DTDavid Thomson
David Thomson

16 April 2025 in IEEE Access
Verified
Journal Article
Open access
YOYoshihiro Ohba
Yoshihiro Ohba
TSTomoya Sanuki
Tomoya Sanuki
CGClaude Gravel
Claude Gravel
KMKentaro Mihara
Kentaro Mihara
AWAsuka Wakasugi
Asuka Wakasugi
KAKenta Adachi
Kenta Adachi
In this study, we introduce a new approach to secure computing by implementing a platform that utilizes a non-volatile memory express (NVMe)-based system with an FPGA-based Torus fully homomorphic encryption (TFHE) accelerator, solid state drive (SSD), and middleware on the host-side. Our platform is the first to offer completely secure computing capabilities for TFHE by using an FPGA-based accelerator. We defined secure computing instructions to evaluate 14-bit to 14-bit functions using TFHE. Our middleware allows for the communication of ciphertexts, keys, and secure computing programs while invoking secure computing programs through NVMe commands with metadata. Our performance evaluation demonstrates that our secure computing platform outperforms CPU-based and GPU-based platforms by 15 to 120 times and 2.5 to 3 times, respectively, in gate bootstrapping execution time. Additionally, our platform uses 7 to 12 times less electric energy consumption during the gate bootstrapping execution time than CPU-based platforms and 4.95 times less than a GPU-based platform. The performance of a machine learning application running on our platform shows that bootstrapping accounts for more than 80% of ciphertext learning time.

31 March 2026 in Computer
Verified
Journal Article
Closed access
RARui Abreu
Rui Abreu
Shaukat AliShaukat Ali
Shaukat Ali
PAPaolo Arcaini
Paolo Arcaini
JCJosé Campos
José Campos
MFMichael Felderer
Michael Felderer
JZJianjun Zhao
Jianjun Zhao
As quantum software grows in complexity, the classical simulation of quantum computers becomes infeasible. This article presents the key challenges in testing large-scale quantum software and offers software engineering perspectives for addressing them.

11 November 2020 in arXiv
Verified
Preprint
Open access
PDF file
LDLuc Devroye
Luc Devroye
CGClaude Gravel
Claude Gravel
For any discrete probability distributions with bounded entropy, we can generate exactly a random variate using only a finite expected number of perfect coin flips. A perfect coin flip is the outcome of an unbiased Bernoulli random variable. Coin flips are unbiased, independently and identically distributed in all our work. We survey well-known algorithms for the discrete case such as the one from Knuth and Yao as well as the one from Han and Hoshi. We also discuss briefly about a practical implementation for the algorithm proposed by Knuth and Yao. For the continuous case, only approximations can be hoped for. The freedom to choose the accuracy for the approximations matters, and, for that, we propose to measure accuracy in terms of the Wasserstein $L_\infty$-metric. We derive a universal lower bound for the expected number of perfect coin flips required to reach a desired accuracy. We also provide several algorithms for absolutely continuous distributions that come within our universal lower bound.

11 July 2019 in arXiv
Verified
Preprint
Open access
PDF file
CGClaude Gravel
Claude Gravel
DPDaniel Panario
Daniel Panario
DTDavid Thomson
David Thomson
In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is $n-1$; (2) the permutation is unicyclic; (3) the number of terms of the algebraic normal form of each component is at least $2^{n-1}$. We call permutations that satisfy these three properties simultaneously unicyclic strong permutations. We prove that our permutations $\sigma$ always have high algebraic degree and that the average number of terms of each component function tends to $2^{n-1}$. We also give a condition on the cycle structure of $\sigma$. We observe empirically that for $n$ even, our construction does not provide unicylic permutations. For $n$ odd, $n \leq 11$, we conduct an exhaustive search of all $\sigma$ given our construction for specific examples of unicylic strong permutations. We also present some empirical results on the difference tables and linear approximation tables of $\sigma$.