Raymond K. Zhao

Dr. Raymond K. Zhao

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
6 November 2019
Verified
Conference Paper
Open access
PDF file
MEMuhammed F. Esgin
Muhammed F. Esgin
RZRaymond K. Zhao
Raymond K. Zhao
RSRon Steinfeld
Ron Steinfeld
JLJoseph K. Liu
Joseph K. Liu
DLDongxi Liu
Dongxi Liu

9 May 2023
Verified
Conference Paper
Open access
GTGeorge Tasopoulos
George Tasopoulos
CDCharis Dimopoulos
Charis Dimopoulos
Apostolos FournarisApostolos Fournaris
Apostolos Fournaris
RZRaymond K. Zhao
Raymond K. Zhao
Amin SakzadAmin Sakzad
Amin Sakzad
RSRon Steinfeld
Ron Steinfeld
Post-Quantum cryptography (PQC), in the past few years, constitutes the main driving force of the quantum resistance transition for security primitives, protocols and tools. TLS is one of the widely used security protocols that needs to be made quantum safe. However, PQC algorithms integration into TLS introduce various implementation overheads compared to traditional TLS that in battery powered embedded devices with constrained resources, cannot be overlooked. While there exist several works, evaluating the PQ TLS execution time overhead in embedded systems there are only a few that explore the PQ TLS energy consumption cost. In this paper, a thorough power/energy consumption evaluation and analysis of PQ TLS 1.3 on embedded systems has been made. A WolfSSL PQ TLS 1.3 custom implementation is used that integrates all the NIST PQC algorithms selected for standardisation as well as 2 out of 3 of those evaluated in NIST Round 4. Also 1 out of 2 of the BSI recommendations have been included. The PQ TLS 1.3 with the various PQC algorithms is deployed in a STM Nucleo evaluation board under a mutual and a unilateral client-server authentication scenario. The power and energy consumption collected results are analyzed in detail. The performed comparisons and overall analysis provide very interesting results indicating that the choice of the PQC algorithms in TLS 1.3 to be deployed on an embedded system may be very different depending on the device use as an authenticated or not authenticated, client or server. Also, the results indicate that in some cases, PQ TLS 1.3 implementations can be equally or more energy consumption efficient compared to traditional TLS 1.3.

19 November 2022
Verified
Book Chapter
Closed access
PDF file
GTGeorge Tasopoulos
George Tasopoulos
JLJinhui Li
Jinhui Li
Apostolos FournarisApostolos Fournaris
Apostolos Fournaris
RZRaymond K. Zhao
Raymond K. Zhao
Amin SakzadAmin Sakzad
Amin Sakzad
RSRon Steinfeld
Ron Steinfeld

12 September 2019 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
RZRaymond K. Zhao
Raymond K. Zhao
RSRon Steinfeld
Ron Steinfeld
Amin SakzadAmin Sakzad
Amin Sakzad
The discrete Gaussian sampler is one of the fundamental tools in implementing lattice-based cryptosystems. However, a naive discrete Gaussian sampling implementation suffers from side-channel vulnerabilities, and the existing countermeasures usually introduce significant overhead in either the running speed or the memory consumption. In this paper, we propose a fast, compact, and constant-time implementation of the binary sampling algorithm, originally introduced in the BLISS signature scheme. Our implementation adapts the Rényi divergence and the transcendental function polynomial approximation techniques. The efficiency of our scheme is independent of the standard deviation, and we show evidence that our implementations are either faster or more compact than several existing constant-time samplers. In addition, we show the performance of our implementation techniques applied to and integrated with two existing signature schemes: qTesla and Falcon. On the other hand, the convolution theorems are typically adapted to sample from larger standard deviations, by combining samples with much smaller standard deviations. As an additional contribution, we show better parameters for the convolution theorems.

20 February 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
WLWai-Kong Lee
Wai-Kong Lee
RZRaymond K. Zhao
Raymond K. Zhao
RSRon Steinfeld
Ron Steinfeld
Amin SakzadAmin Sakzad
Amin Sakzad
Seong Oun HwangSeong Oun Hwang
Seong Oun Hwang
The US National Institute of Standards and Technology initiated a standardization process for post-quantum cryptography in 2017, with the aim of selecting key encapsulation mechanisms and signature schemes that can withstand the threat from emerging quantum computers. In 2022, Falcon was selected as one of the standard signature schemes, eventually attracting effort to optimize the implementation of Falcon on various hardware architectures for practical applications. Recently, Mitaka was proposed as an alternative to Falcon, allowing parallel execution of most of its operations. These recent advancements motivate us to develop high throughput implementations of Falcon and Mitaka signature schemes on Graphics Processing Units (GPUs), a massively parallel architecture widely available on cloud service platforms. In this article, we propose the first parallel implementation of Falcon on various GPUs. We develop an iterative version of the sampling process in Falcon, which is also the most time-consuming Falcon operation. This allows us to implement Falcon signature generation without relying on expensive recursive function calls on GPUs. In addition, we propose a parallel random samples generation approach to accelerate the performance of Mitaka on GPUs. We evaluate our implementation techniques on state-of-the-art GPU architectures (RTX 3080, A100, T4 and V100). Experimental results show that our Falcon-512 implementation achieves 58,595 signatures/second and 2,721,562 verifications/second on an A100 GPU, which is $20.03\times$ and $29.51\times$ faster than the highly optimized AVX2 implementation on CPU. Our Mitaka implementation achieves 161,985 signatures/second and 1,421,046 verifications/second on the same GPU. Due to the adoption of a parallelizable sampling process, Mitaka signature generation enjoys $\approx 2$ – $20 \times$ higher throughput than Falcon on various GPUs. The high throughput signature generation and verification achieved by this work can be very useful in various emerging applications, including the Internet of Things.

10 April 2020
Verified
Book Chapter
Closed access
PDF file
RZRaymond K. Zhao
Raymond K. Zhao
RSRon Steinfeld
Ron Steinfeld
ASAmin Sakzad
Amin Sakzad