Jehyuk Jang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jehyuk Jang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Heung-No Lee
Gwangju Institute of Science and Technology
6 shared publications - Geunsu Seo
The LG Innotek, Ansan 426791, Korea
1 shared publication - Hyoungsung Kim
Korea Electronics Technology Institute, Seoul, Republic of Korea
1 shared publication - Jongjin Kang
The Hanwha System, Seongnam 13524, Korea
1 shared publication - Jusung Kang
School of Electrical Engineering and Computer Science, Gwangju Institute of Science and Technology, Gwangju, South Korea
1 shared publication - Kiwon Yang
School of Electrical Engineering and Computer Science, Gwangju Institute of Science and Technology, Gwangju, South Korea
1 shared publication
Latest Publications
- Open Access
- 15 September 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (18) , 9233
Correction: Jang, J.; Lee, H.-N. Profitable Double-Spending Attacks. Appl. Sci. 2020, 10, 8477
There was an error in the original publication
- 15 September 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (18) , 9233
Open AccessCorrection: Jang, J.; Lee, H.-N. Profitable Double-Spending Attacks. Appl. Sci. 2020, 10, 8477
There was an error in the original publication
- Open Access
- 16 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 135942-135952
Error-Correction Code Proof-of-Work on Ethereum
The error-correction code proof-of-work (ECCPoW) algorithm is based on a low-density parity-check (LDPC) code. ECCPoW can impede the advent of mining application-specific integrated circuits (ASICs) with its time-varying puzzle generation capability. Previous research studies on ECCPoW algorithm have presented its theory and implementation on Bitcoin. In this study, we have not only designed ECCPoW for Ethereum, called ETH-ECC, but have also implemented, simulated, and validated it. In the implementation, we have explained how ECCPoW algorithm has been integrated into Ethereum 1.0 as a new consensus algorithm. Furthermore, we have devised and implemented a new method for controlling the difficulty level in ETH-ECC. In the simulation, we have tested the performance of ETH-ECC using a large number of node tests and demonstrated that the ECCPoW Ethereum works well with automatic difficulty-level change capability in real-world experimental settings. In addition, we discuss how stable the block generation time (BGT) of ETH-ECC is. Specifically, one key issue we intend to investigate is the finiteness of the mean of ETH-ECC BGT. Owing to a time-varying cryptographic puzzle generation system in ECCPoW algorithm, BGT in the algorithm may lead to a long-tailed distribution. Thus, simulation tests have been performed to determine whether BGT distribution is not heavy-tailed and has a finite mean. If the distribution is heavy-tailed, stable transaction confirmation cannot be guaranteed. In the validation, we have presented statistical analysis results based on the two-sample Anderson–Darling test and discussed how the BGT distribution follows an exponential distribution which has a finite mean. Our implementation is available for download at https://github.com/cryptoecc/ETH-ECC .
- 16 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 135942-135952
Open AccessError-Correction Code Proof-of-Work on Ethereum
The error-correction code proof-of-work (ECCPoW) algorithm is based on a low-density parity-check (LDPC) code. ECCPoW can impede the advent of mining application-specific integrated circuits (ASICs) with its time-varying puzzle generation capability. Previous research studies on ECCPoW algorithm have presented its theory and implementation on Bitcoin. In this study, we have not only designed ECCPoW for Ethereum, called ETH-ECC, but have also implemented, simulated, and validated it. In the implementation, we have explained how ECCPoW algorithm has been integrated into Ethereum 1.0 as a new consensus algorithm. Furthermore, we have devised and implemented a new method for controlling the difficulty level in ETH-ECC. In the simulation, we have tested the performance of ETH-ECC using a large number of node tests and demonstrated that the ECCPoW Ethereum works well with automatic difficulty-level change capability in real-world experimental settings. In addition, we discuss how stable the block generation time (BGT) of ETH-ECC is. Specifically, one key issue we intend to investigate is the finiteness of the mean of ETH-ECC BGT. Owing to a time-varying cryptographic puzzle generation system in ECCPoW algorithm, BGT in the algorithm may lead to a long-tailed distribution. Thus, simulation tests have been performed to determine whether BGT distribution is not heavy-tailed and has a finite mean. If the distribution is heavy-tailed, stable transaction confirmation cannot be guaranteed. In the validation, we have presented statistical analysis results based on the two-sample Anderson–Darling test and discussed how the BGT distribution follows an exponential distribution which has a finite mean. Our implementation is available for download at https://github.com/cryptoecc/ETH-ECC .
- Open Access
- 27 November 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (23) , 8477
Profitable Double-Spending Attacks
Our aim in this paper is to investigate the profitability of double-spending (DS) attacks that manipulate an a priori mined transaction in a blockchain. It was well understood that a successful DS attack is established when the proportion of computing power an attacker possesses is higher than that of the honest network. What is not yet well understood is how threatening a DS attack with less than 50% computing power used can be. Namely, DS attacks at any proportion can be a threat as long as the chance to make a good profit exists. Profit is obtained when the revenue from making a successful DS attack is greater than the cost of carrying out one. We have developed a novel probability theory for calculating a finitetime attack probability. This can be used to size up attack resources needed to obtain the profit. The results enable us to derive a sufficient and necessary condition on the value of a transaction targeted by a DS attack. Our result is quite surprising: we theoretically show how a DS attack at any proportion of computing power can be made profitable. Given one’s transaction value, the results can also be used to assess the risk of a DS attack. An example of profitable DS attack against BitcoinCash is provided.
- 27 November 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (23) , 8477
Open AccessProfitable Double-Spending Attacks
Our aim in this paper is to investigate the profitability of double-spending (DS) attacks that manipulate an a priori mined transaction in a blockchain. It was well understood that a successful DS attack is established when the proportion of computing power an attacker possesses is higher than that of the honest network. What is not yet well understood is how threatening a DS attack with less than 50% computing power used can be. Namely, DS attacks at any proportion can be a threat as long as the chance to make a good profit exists. Profit is obtained when the revenue from making a successful DS attack is greater than the cost of carrying out one. We have developed a novel probability theory for calculating a finitetime attack probability. This can be used to size up attack resources needed to obtain the profit. The results enable us to derive a sufficient and necessary condition on the value of a transaction targeted by a DS attack. Our result is quite surprising: we theoretically show how a DS attack at any proportion of computing power can be made profitable. Given one’s transaction value, the results can also be used to assess the risk of a DS attack. An example of profitable DS attack against BitcoinCash is provided.
- Open Access
- 20 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 23 (5) , 867-870
Multimodal Sparse Representation-Based Classification Scheme for RF Fingerprinting
In this letter, we propose a multimodal method for improving radio frequency (RF) fingerprinting performance that uses multiple features cultivated from RF signals. Combining multiple features, including a falling transient feature that has not previously been used in RF fingerprinting studies, we aim to demonstrate that the proposed method results in improved accuracy. We show that a sparse representation-based classification (SRC) scheme can be a good platform for combining multiple features. The experimental results on RF signals acquired from eight walkie-talkies show that the RF fingerprinting accuracy of the proposed method improves significantly as the number of features increases.
- 20 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 23 (5) , 867-870
Open AccessMultimodal Sparse Representation-Based Classification Scheme for RF Fingerprinting
In this letter, we propose a multimodal method for improving radio frequency (RF) fingerprinting performance that uses multiple features cultivated from RF signals. Combining multiple features, including a falling transient feature that has not previously been used in RF fingerprinting studies, we aim to demonstrate that the proposed method results in improved accuracy. We show that a sparse representation-based classification (SRC) scheme can be a good platform for combining multiple features. The experimental results on RF signals acquired from eight walkie-talkies show that the RF fingerprinting accuracy of the proposed method improves significantly as the number of features increases.
- Open Access
- 18 September 2018
- Published by MDPI AG in Electronics
- Vol. 7 (9) , 206
Reduced Computational Complexity Orthogonal Matching Pursuit Using a Novel Partitioned Inversion Technique for Compressive Sensing
This paper reports a field-programmable gate array (FPGA) design of compressed sensing (CS) using the orthogonal matching pursuit (OMP) algorithm. While solving the least-squares (LS) problem in the OMP algorithm, the complexity of the matrix inversion operation at every loop is reduced by the proposed partitioned inversion that utilizes the inversion result in the previous iteration. By the proposed matrix (n × n) inversion method inside the OMP, the number of operations is reduced down from O(n3) to O(n2). The OMP algorithm is implemented with a Xilinx Kintex UltraScale. The architecture with the proposed partitioned inversion involves 722 less DSP48E compared with the conventional method. It operates with a sample period of 4 ns, signal reconstruction time of 27 μs, and peak signal to noise ratio (PSNR) of 30.26 dB.
- 18 September 2018
- Published by MDPI AG in Electronics
- Vol. 7 (9) , 206
Open AccessReduced Computational Complexity Orthogonal Matching Pursuit Using a Novel Partitioned Inversion Technique for Compressive Sensing
This paper reports a field-programmable gate array (FPGA) design of compressed sensing (CS) using the orthogonal matching pursuit (OMP) algorithm. While solving the least-squares (LS) problem in the OMP algorithm, the complexity of the matrix inversion operation at every loop is reduced by the proposed partitioned inversion that utilizes the inversion result in the previous iteration. By the proposed matrix (n × n) inversion method inside the OMP, the number of operations is reduced down from O(n3) to O(n2). The OMP algorithm is implemented with a Xilinx Kintex UltraScale. The architecture with the proposed partitioned inversion involves 722 less DSP48E compared with the conventional method. It operates with a sample period of 4 ns, signal reconstruction time of 27 μs, and peak signal to noise ratio (PSNR) of 30.26 dB.
- Open Access
- 9 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 66 (12) , 3311-3326
Intentional Aliasing Method to Improve Sub-Nyquist Sampling System
A modulated wideband converter (MWC) has been introduced as a sub-Nyquist sampler that exploits a set of fast alternating pseudo random (PR) signals. Through parallel analog channels, an MWC compresses a multiband spectrum by mixing it with PR signals in the time domain, and acquires its sub-Nyquist samples. Previously, the ratio of compression was fully dependent on the specifications of PR signals. That is, to further reduce the sampling rate without information loss, faster and longer-period PR signals were needed. However, the implementation of such PR signal generators results in high power consumption and large fabrication area. In this paper, we propose a novel aliased modulated wideband converter (AMWC), which can further reduce the sampling rate of MWC with fixed PR signals. The main idea is to induce intentional signal aliasing at the analog-to-digital converter (ADC). In addition to the first spectral compression by the signal mixer, the intentional aliasing compresses the mixed spectrum once again. We demonstrate that AMWC reduces the number of analog channels and the rate of ADC for lossless sub-Nyquist sampling without needing to upgrade the speed or the period of PR signals. Conversely, for a given fixed number of analog channels and sampling rate, AMWC improves the performance of signal reconstruction.
- 9 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 66 (12) , 3311-3326
Open AccessIntentional Aliasing Method to Improve Sub-Nyquist Sampling System
A modulated wideband converter (MWC) has been introduced as a sub-Nyquist sampler that exploits a set of fast alternating pseudo random (PR) signals. Through parallel analog channels, an MWC compresses a multiband spectrum by mixing it with PR signals in the time domain, and acquires its sub-Nyquist samples. Previously, the ratio of compression was fully dependent on the specifications of PR signals. That is, to further reduce the sampling rate without information loss, faster and longer-period PR signals were needed. However, the implementation of such PR signal generators results in high power consumption and large fabrication area. In this paper, we propose a novel aliased modulated wideband converter (AMWC), which can further reduce the sampling rate of MWC with fixed PR signals. The main idea is to induce intentional signal aliasing at the analog-to-digital converter (ADC). In addition to the first spectral compression by the signal mixer, the intentional aliasing compresses the mixed spectrum once again. We demonstrate that AMWC reduces the number of analog channels and the rate of ADC for lossless sub-Nyquist sampling without needing to upgrade the speed or the period of PR signals. Conversely, for a given fixed number of analog channels and sampling rate, AMWC improves the performance of signal reconstruction.