forked from daattali/beautiful-jekyll
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
bdf256f
commit 0fb9a04
Showing
2 changed files
with
80 additions
and
69 deletions.
There are no files selected for viewing
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -73,7 +73,7 @@ | |
| %----------------------------------------------------------- | ||
| \textbf{\Large Junhao Huang} & \\% $|$ EE10S0600 | ||
| PhD Student& \\%Research Scholar | ||
| BNU-HKBU United International College, Zhuhai, China \\ | ||
| Beijing Normal University-Hong Kong Baptist University United International College (UIC) \\ | ||
| +86-18626423381 \\ | ||
| jhhuang\_[email protected], [email protected] \\ | ||
| % \href{https://junhaohuang.github.io/}{Home Page} | ||
|
|
@@ -133,7 +133,7 @@ | |
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| \begin{itemize} | ||
| \item | ||
| Cryptographic Engineering, Public-key Cryptography, Lattice-based Cryptography. | ||
| Cryptographic Engineering, Post-quantum Cryptography, Lattice-based Cryptography, Modular Arithmetic. | ||
|
|
||
| \end{itemize} | ||
|
|
||
|
|
@@ -160,6 +160,10 @@ | |
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| \textbf{- Journal Publications} | ||
| \begin{enumerate}\setlength{\itemsep}{0pt} | ||
| \item {Optimized Software Implementation of Keccak, Kyber, and Dilithium on RV\{32,64\}IM\{B\}\{V\},\\ | ||
| Jipeng Zhang, Yuxing Yan, \textbf{Junhao Huang}, Çetin Kaya Koç*.\\ | ||
| In \textcolor{blue}{IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2025, Issue 1} (\textbf{CCF-B}) | ||
| } | ||
| \item {Yet another Improvement of Plantard Arithmetic for Faster Kyber on Low-end 32-bit IoT Devices,\\ | ||
| \textbf{Junhao Huang}, Haosong Zhao, Jipeng Zhang, Wangchen Dai, Lu Zhou, \c{C}etin Kaya Ko\c{c}, Ray C.C. Cheung, Donglong Chen*. \\ | ||
| In \textcolor{blue}{IEEE Transactions on Information Forensics \& Security, 2024.} (\textbf{CCF-A}) | ||
|
|
@@ -193,11 +197,16 @@ | |
| \end{enumerate} | ||
| \textbf{- Conference Publications} | ||
| \begin{enumerate}\setlength{\itemsep}{0pt} | ||
| \item {ENG25519: Faster TLS 1.3 handshake using optimized X25519 and Ed25519.\\ | ||
| \item {ENG25519: Faster TLS 1.3 handshake using optimized X25519 and Ed25519,\\ | ||
| Jipeng Zhang, \textbf{Junhao Huang}, Lirui Zhao, Donglong Chen, Çetin Kaya Koç*.\\ | ||
| In \textcolor{blue}{Usenix Security, 2024.} (\textbf{CCF-A}) | ||
| } | ||
|
|
||
| \item {Multi-way High-throughput Implementation of Kyber,\\ | ||
| Xuan Yu, Jipeng Zhang, \textbf{Junhao Huang}, Donglong Chen, Lu Zhou*\\ | ||
| In \textcolor{blue}{Information Security Conference (ISC), 2024} | ||
| } | ||
|
|
||
| \item {Efficient Implementation of Kyber on Mobile Devices,\\ | ||
| Lirui Zhao, Jipeng Zhang, \textbf{Junhao Huang}, Zhe Liu*, Gerhard Hancke,\\ | ||
| In \textcolor{blue}{IEEE International Conference on Parallel and Distributed Systems - ICPADS 2021.} (\textbf{CCF-C}) | ||
|
|
@@ -213,102 +222,104 @@ | |
|
|
||
| \end{enumerate} | ||
|
|
||
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| \resheading{Reaserch Experiences} | ||
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| \begin{itemize} | ||
| \item | ||
| Jul. 2023- Oct. 2023,\quad Revisiting Keccak and Dilithium Implementations on ARMv7-M | ||
| % \begin{comment}%开始注释 | ||
| \begin{itemize} | ||
| \resitem{Further improve Keccak's performance using lazy rotation and better memory access scheduling on ARMv7-M.} | ||
| \resitem{Efficient multi-moduli NTT with Plantard arithmetic for the small polynomial multiplication in Dilithium on ARM Cortex-M3.} | ||
| \resitem{Obtain large speed-ups for Keccak and Dilithium on Cortex-M3 and Cortex-M4.} | ||
| \end{itemize} | ||
| \item | ||
| Sep. 2022- Mar. 2023,\quad Yet another Improvement of Plantard Arithmetic for Faster Kyber on Low-end 32-bit IoT Devices | ||
| % \begin{comment}%开始注释 | ||
| \begin{itemize} | ||
| \resitem{Further extend the input range of the improved Plantard arithmetic tailored for Kyber.} | ||
| \resitem{Efficient NTT/INTT implementation on Cortex-M3 and RISC-V.} | ||
| \resitem{Speed-ups for Kyber on Cortex-M3 and RISC-V.} | ||
| \end{itemize} | ||
| \item | ||
| Sep. 2021- Apr. 2022,\quad Improved Plantard Arithmetic for Lattice-based Cryptography | ||
| % \begin{comment}%开始注释 | ||
| \begin{itemize} | ||
| \resitem{Present an improved Plantard arithmetic tailored for LBC.} | ||
| \resitem{Obtained speed-ups for Kyber and NTTRU with 16-bit NTT on Cortex-M4.} | ||
| \resitem{The source code has been merged into \href{https://github.com/mupq/pqm4/pull/244}{pqm4, PR\#244} (merged at 25th, Oct, 2022).} | ||
| \end{itemize} | ||
| % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| % \resheading{Reaserch Experiences} | ||
| % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| % \begin{itemize} | ||
| % \item | ||
| % Jul. 2023- Oct. 2023,\quad Revisiting Keccak and Dilithium Implementations on ARMv7-M | ||
| % % \begin{comment}%开始注释 | ||
| % \begin{itemize} | ||
| % \resitem{Further improve Keccak's performance using lazy rotation and better memory access scheduling on ARMv7-M.} | ||
| % \resitem{Efficient multi-moduli NTT with Plantard arithmetic for the small polynomial multiplication in Dilithium on ARM Cortex-M3.} | ||
| % \resitem{Obtain large speed-ups for Keccak and Dilithium on Cortex-M3 and Cortex-M4.} | ||
| % \end{itemize} | ||
| % \item | ||
| % Sep. 2022- Mar. 2023,\quad Yet another Improvement of Plantard Arithmetic for Faster Kyber on Low-end 32-bit IoT Devices | ||
| % % \begin{comment}%开始注释 | ||
| % \begin{itemize} | ||
| % \resitem{Further extend the input range of the improved Plantard arithmetic tailored for Kyber.} | ||
| % \resitem{Efficient NTT/INTT implementation on Cortex-M3 and RISC-V.} | ||
| % \resitem{Speed-ups for Kyber on Cortex-M3 and RISC-V.} | ||
| % \end{itemize} | ||
| % \item | ||
| % Sep. 2021- Apr. 2022,\quad Improved Plantard Arithmetic for Lattice-based Cryptography | ||
| % % \begin{comment}%开始注释 | ||
| % \begin{itemize} | ||
| % \resitem{Present an improved Plantard arithmetic tailored for LBC.} | ||
| % \resitem{Obtained speed-ups for Kyber and NTTRU with 16-bit NTT on Cortex-M4.} | ||
| % \resitem{The source code has been merged into \href{https://github.com/mupq/pqm4/pull/244}{pqm4, PR\#244} (merged at 25th, Oct, 2022).} | ||
| % \end{itemize} | ||
|
|
||
| \item | ||
| Dec. 2020- Apr. 2021,\quad Memory Efficient Implementation of Saber on RISC-V | ||
| % \begin{comment}%开始注释 | ||
| \begin{itemize} | ||
| \resitem{Reduce the memory usage of Saber by using a \textbf{just-in-time} public matrix, secret, and noise generation technique.} | ||
| \resitem{Represent the secret, and noise with a new \textbf{smaller data-type}, which reduces the size of the secret and noise.} | ||
| \end{itemize} | ||
| \item | ||
| Apr. 2019- Nov. 2020,\quad Accelerating ECC utilizing the Double Precision Floating-point Number on GPU | ||
| % \begin{comment}%开始注释 | ||
| \begin{itemize} | ||
| \resitem{Implement the prime field arithmetic for the prime modulus $p=2^n-\delta$ by combining the computing power of \textbf{the fused multiply-add instruction of double-precision floating-point number} and the addition, subtraction, and shift instructions of integer number. } | ||
| \resitem{Propose how to perform multi-precision multiplication over unreduced-form big number, which optimizes the point multiplication, especially Montgomery ladder algorithm for Montgomery curves, with the \textbf{lazy reduction technique}.} | ||
| \end{itemize} | ||
| % \item | ||
| % Dec. 2020- Apr. 2021,\quad Memory Efficient Implementation of Saber on RISC-V | ||
| % % \begin{comment}%开始注释 | ||
| % \begin{itemize} | ||
| % \resitem{Reduce the memory usage of Saber by using a \textbf{just-in-time} public matrix, secret, and noise generation technique.} | ||
| % \resitem{Represent the secret, and noise with a new \textbf{smaller data-type}, which reduces the size of the secret and noise.} | ||
| % \end{itemize} | ||
| % \item | ||
| % Apr. 2019- Nov. 2020,\quad Accelerating ECC utilizing the Double Precision Floating-point Number on GPU | ||
| % % \begin{comment}%开始注释 | ||
| % \begin{itemize} | ||
| % \resitem{Implement the prime field arithmetic for the prime modulus $p=2^n-\delta$ by combining the computing power of \textbf{the fused multiply-add instruction of double-precision floating-point number} and the addition, subtraction, and shift instructions of integer number. } | ||
| % \resitem{Propose how to perform multi-precision multiplication over unreduced-form big number, which optimizes the point multiplication, especially Montgomery ladder algorithm for Montgomery curves, with the \textbf{lazy reduction technique}.} | ||
| % \end{itemize} | ||
| % \item | ||
| % Sep. 2019- Mar. 2020,\quad Accelerating SM2 on GPU | ||
| % % \begin{comment}%开始注释 | ||
| % \begin{itemize} | ||
| % \resitem{Implement the prime field arithmetic for SM2 using the low-level PTX assembly language on GPU, which contributes to the performance of the high-level point arithmetic and cryptographic protocols of SM2.} | ||
| % \end{itemize} | ||
| \item | ||
| Apr. 2019- Oct. 2019,\quad Parallel Implementation of SM2 Elliptic Curve with AVX2 | ||
| % \begin{comment}%开始注释 | ||
| \begin{itemize} | ||
| \resitem{Utilize SIMD AVX2 instruction set to implement 2-way SM2 prime field operations.} | ||
| % \item | ||
| % Apr. 2019- Oct. 2019,\quad Parallel Implementation of SM2 Elliptic Curve with AVX2 | ||
| % % \begin{comment}%开始注释 | ||
| % \begin{itemize} | ||
| % \resitem{Utilize SIMD AVX2 instruction set to implement 2-way SM2 prime field operations.} | ||
|
|
||
| \resitem{Reschedule the (X,Y)-only Co-Z Jacobian arithmetic and perform the symmetric operations using the 2-way prime field operations} | ||
| % \resitem{Reschedule the (X,Y)-only Co-Z Jacobian arithmetic and perform the symmetric operations using the 2-way prime field operations} | ||
|
|
||
| \resitem{Implement the Co-Z based Montgomery ladder algorithm based on the parallel Co-Z Jacobian arithmetic.} | ||
| % \resitem{Implement the Co-Z based Montgomery ladder algorithm based on the parallel Co-Z Jacobian arithmetic.} | ||
|
|
||
| \resitem{The number of the 2-way prime field operations of the Co-Z Jacobian arithmetic is reduced to a half compared to the sequential implementation.} | ||
| % \resitem{The number of the 2-way prime field operations of the Co-Z Jacobian arithmetic is reduced to a half compared to the sequential implementation.} | ||
|
|
||
| \resitem{The AVX2 version Co-Z based Montgomery ladder algorithm is \textbf{1.31} times faster than the X64 assembly implementation.} | ||
| \end{itemize} | ||
| % \resitem{The AVX2 version Co-Z based Montgomery ladder algorithm is \textbf{1.31} times faster than the X64 assembly implementation.} | ||
| % \end{itemize} | ||
| % \item | ||
| % Nov. 2016- Mar. 2017\quad University Association Information Management System (APP) | ||
| % \begin{itemize} | ||
| % \resitem{An app that facilitates internal communication and management of associations, and simplifies members' participation in association activities.} | ||
| % \resitem{Achieve Association management, Association activities management, Association member management.} | ||
| % \resitem{Applied for a \textbf{Software Copyright}.} | ||
| % \end{itemize} | ||
| \end{itemize} | ||
| % \end{itemize} | ||
|
|
||
|
|
||
|
|
||
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| \resheading{Honor Certificates} | ||
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| \begin{itemize} | ||
| \item | ||
| Aug. 2024\quad \textbf{Distinguished Paper Award} of the 33rd USENIX Security Symposium. | ||
| \item | ||
| May. 2023\quad Third prize for the Guangdong Province Cyberspace Security Outstanding Paper Award, GDCA. | ||
| \item | ||
| Apr. 2023\quad Best RPG Poster Award of Faculty of Science \& Technology, BNU-HKBU UIC. | ||
| \item | ||
| Nov. 2019\quad Patent for An efficient implementation of Co-Z based Montgomery ladder algorithm using AVX2, CN112367172A. | ||
| \item | ||
| Oct. 2018\quad Postgraduate \textbf{First prize} Scholarship | ||
| \item | ||
| Oct. 2018\quad \textbf{First Prize} of Academic Scholarship | ||
| \item | ||
| Jun. 2018\quad Software Copyright for the University Association Information Management System | ||
| \item | ||
| Oct. 2017\quad National Encouragement Scholarship, \textbf{Third Prize} of Outstanding Student Scholarship | ||
| \item | ||
| Oct. 2016\quad National Encouragement Scholarship, \textbf{Second Prize} of Outstanding Student Scholarship | ||
| \item | ||
| Oct. 2015\quad National Encouragement Scholarship, \textbf{First Prize} of Outstanding Student Scholarship | ||
| % \item | ||
| % Oct. 2018\quad Postgraduate \textbf{First prize} Scholarship | ||
| % \item | ||
| % Oct. 2018\quad \textbf{First Prize} of Academic Scholarship | ||
| % \item | ||
| % Jun. 2018\quad Software Copyright for the University Association Information Management System | ||
| % \item | ||
| % Oct. 2017\quad National Encouragement Scholarship, \textbf{Third Prize} of Outstanding Student Scholarship | ||
| % \item | ||
| % Oct. 2016\quad National Encouragement Scholarship, \textbf{Second Prize} of Outstanding Student Scholarship | ||
| % \item | ||
| % Oct. 2015\quad National Encouragement Scholarship, \textbf{First Prize} of Outstanding Student Scholarship | ||
| \end{itemize} | ||
|
|
||
|
|
||
|
|
@@ -317,7 +328,7 @@ | |
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | ||
| \begin{enumerate}\setlength{\itemsep}{0pt} | ||
| \item {Language Level: CET-4: 597, CET-6: 513, IELTS: 7.0} | ||
| \item {Programming Language: C/C++, x86-64/Cortex-M4/Cortex-M3/RISC-V Assembly, AVX2 and CUDA programming, Python} | ||
| \item {Skills: C/C++, x86-64, ARM, RISC-V, AVX2, CUDA, Python} | ||
| \end{enumerate} | ||
|
|
||
| % % \begin{comment}%开始注释 | ||
|
|
||