7
collaborators
2020–2021
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Benchmarking a Quantum Random Number Generator with Machine Learning | QCRYPT 2020 | regular | Jing Yan Haw, Syed Muhamad Assad, Ping Koy Lam, Omid Kavehei |
Random number generators (RNGs) that are crucial for cryptographic applications have been the subject of adversarial attacks. These attacks exploit environmental information to predict generated random numbers that are supposed to be truly random and unpredictable. Though quantum random number generators (QRNGs) are based on the intrinsic indeterministic nature of quantum properties, the presence of classical noise in the measurement process compromises the integrity of a QRNG. In this paper, we develop a predictive machine learning (ML) analysis to investigate the impact of deterministic classical noise in different stages of an optical continuous variable QRNG. Our ML model successfully detects inherent correlations when the deterministic noise sources are prominent. After appropriate filtering and randomness extraction processes are introduced, our QRNG system, in turn, demonstrates its robustness against ML. We further demonstrate the robustness of our ML approach by applying it to uniformly distributed random numbers from the QRNG and a congruential RNG. Hence, our result shows that ML has potentials in benchmarking the quality of RNG devices. |
|||
1 Poster
| Title | Conference | Co-authors |
|---|---|---|
| Certification of Random Number Generators using Machine Learning | QCRYPT 2021 | Ng Hong Jie, Raymond Ho, Syed Muhamad Assad, Ping Koy Lam, Omid Kavehei, Wang Chao, Jing Yan Haw |
Two coveted qualities for a random number generator (RNG) are uniformity and unpredictability. A Pseudo-RNG (PRNG) produces a uniform output, but it is predictable when one has knowledge of the seed and implementation parameters. While a quantum-RNG (QRNG) produces an unpredictable output, it is not necessarily uniform and hence typically requires randomness extraction. We examine these two aspects in RNGs by utilizing a machine learning cryptanalysis, showing the applicability of the tool in uncovering hidden correlations and implementation failures. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Jing Yan Haw | 2 |
| Omid Kavehei | 2 |
| Ping Koy Lam | 2 |
| Syed Muhamad Assad | 2 |
| Ng Hong Jie | 1 |
| Raymond Ho | 1 |
| Wang Chao | 1 |