|
Journal
|
2025 |
Quantum Implementation of S-Boxes Based on Polynomial Evaluation
Chung Do Young Electronics Letters, v.61, no.1, pp.1-7 |
0 |
원문
|
|
Journal
|
2024 |
Toffoli-depth reduction method preserving in-place quantum circuits and its application to SHA3-256
Lee Jongheon Quantum Information Processing, v.23, pp.1-43 |
5 |
원문
|
|
Journal
|
2024 |
T-depth-optimized quantum search with quantum data-access machine
Kyunghyun Baek QUANTUM SCIENCE AND TECHNOLOGY, v.9, no.1, pp.1-12 |
2 |
원문
|
|
Journal
|
2024 |
T-depth-optimized quantum search with quantum data-access machine
박정준 QUANTUM SCIENCE AND TECHNOLOGY, v.9, no.1, pp.1-12 |
2 |
원문
|
|
Journal
|
2023 |
MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
Jongheon Lee Quantum Information Processing, v.22, pp.1-31 |
5 |
원문
|
|
Journal
|
2023 |
T‐depth reduction method for efficient SHA‐256 quantum circuit construction
Jong-Heon Lee IET Information Security, v.17, no.1, pp.46-65 |
6 |
원문
|
|
Journal
|
2022 |
Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation
정갑균 New Journal of Physics, v.24, no.10, pp.1-11 |
3 |
원문
|
|
Journal
|
2022 |
Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation
송우영 New Journal of Physics, v.24, no.10, pp.1-11 |
3 |
원문
|
|
Journal
|
2022 |
Polynomial T-depth quantum solvability of noisy binary linear problem: from quantum-sample preparation to main computation
임영롱 New Journal of Physics, v.24, no.10, pp.1-11 |
3 |
원문
|
|
Conference
|
2021 |
T-depth Reduction Method for Efficient SHA-256 Quantum Circuit Construction
Jong-Heon Lee International Conference on Information Security and Cryptology (ICISC) 2021 (LNCS 13218), pp.368-391 |
0 |
원문
|