• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.4
• /
• pp.73-79
• /
• 2007

In this paper the proposed transactor is customized and a generator which roles of automatically generating the transactor according to DUT(Design Under Test)'s input and output is implemented. The customized transactor is designed by rearranging the signals of depending on DUT and transactor protocol which consists of signals of the PCI interface between host computer and FPGA(Field Programmable Gate Array). The implemented automatic generator of transactor generates a Verilog code of transactor by adding DUT's information about input and output ports. Performance and normal working of the generated transactor has been verified by experiments with some verified hardware IPs. Also, an efficiency of the transactor has been verified by comparing with user's manually designed transactor and generated transactor. Moreover, the generator's flexibility has been verified for DUT's information of variable input and output. In case of using the implemented generator, a design time of transactor is reduced.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.191-194
• /
• 2000

본 논문에서는 기존의 정렬 알고리즘의 성능을 향상시키기 위하여 정보블록 전처리 알고리즘(IBPA)이라는 전처리알고리즘을 제안한다. IBPA는 정렬될 리스트(list)에 있는 데이터에 관한 정보를 생성하고, 생성된 정보를 이용하여 각 데이터를 재배치하며, 실제적인 정렬은 기존의 정렬 알고리즘을 그대로 이용하여 이루어진다. IBPA의 성능을 측정해본 결과, 2백만개의 랜덤데이터를 정렬한 경우, O($N^2$)의 평균시간복잡도를 갖는 정렬알고리즘의 0.003%, O(NlogN) 의 평균시간복잡도를 갖는 정렬알고리즘의 52%, 그리고 O(N)의 평균시간복잡도를 갖는 정렬알고리즘의 89%정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1099-1102
• /
• 2005

다중서명에서는 보안적 요소뿐만 아니라 다중서명의 길이, 다중서명의 생성 및 검증 시간, 복호화 시간, 통신량 등도 중요한 요소이다. 기존의 RSA를 그대로 이용한 RSA 원형 다중서명 방식과 RSA를 변형하여 적용한 RSA 변형 다중서명 방식은 다중서명의 생성 및 검증 시간이 각각의 개인서명을 생성하고 검증하는 시간의 합과 비례하여 증가한다는 문제점이 있다. 본 논문은 서명자의 수만큼 분할된 각각의 부분메시지에 대해 RSA 방식을 이용하여 제각기 서명하는 다중서명 방식을 제안한다. 제안된 메시지 분할을 이용한 RSA 다중서명 방식은 블록의 수가 증가하지 않는 경우 기존 방식에 비해 다중서명의 길이가 증가하지 않으면서, 다중서명의 생성 및 검증 시간이 각각 $\frac{1}{L}$로 감소하고, 복호화 시간과 통신량은 각각 약 $\frac{1}{2}{\sim}\frac{1}{L}$로 감소한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.1
• /
• pp.225-234
• /
• 2019

Bitcoin is a cryptocurrency with characteristics such as de-centralization and distributed ledger, and these features are maintained through a mining system called "proof of work". In the mining system, mining difficulty is adjusted to keep the block generation time constant. However, Bitcoin's current method to update mining difficulty does not reflect the future hash power, so the block generation time can not be kept constant and the error occurs between designed time and real time. This increases the inconsistency between block generation and real world and causes problems such as not meeting deadlines of transaction and exposing the vulnerability to coin-hopping attack. Previous studies to keep the block generation time constant still have the error. In this paper, we propose a machine-learning based method to reduce the error. By training with the previous hash power, we predict the future hash power and adjust the mining difficulty. Our experimental result shows that the error rate can be reduced by about 36% compared with the current method.

• KNOM Review
• /
• v.23 no.1
• /
• pp.26-33
• /
• 2020

Bitcoin is an electronic money that does not rely on centralized institutions such as banks and financial institutions, unlike the world's paper currencies such as dollar, won, euro and yen. In Bitcoin network, a block with transaction details is generated by mining, and the message that the block has been created is broadcast to all participating nodes in a broadcasting method to secure reliability through verification. Likewise, the mining and block propagation methods in the Bitcoin network are greatly affected by the performance of the P2P network. For example, in the case of mining, the node receiving the reward for mining varies depending on whether the block is first mined in the network and the proof of mining is propagated faster. In this paper, we applied local characteristics and Round-to-Trip(RTT) measurement to solve the problems of the existing neighbor connection method and block propagation method performed in Bitcoin network. An algorithm to improve block propagation speed is presented. Through experiments, we compare the performance of the improved algorithm with the existing algorithm to verify that the overall block propagation time is reduced.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.3
• /
• pp.235-242
• /
• 2020

This paper proposes a system that can manage and verify personal career information through a block chain to solve the problem of getting a job by forging an individual's career when hiring employees. Blockchain network uses private network, and inside the block, the user's academic and career information is kept. The functions of the block chain perform the functions of block creation, block internal data retrieval, career and academic verification, which works through chain code. As a result of the performance evaluation of the proposed system, the processing time per transaction was measured at approximately 110 ms and the search time was measured at 10 ms, and it was applied to the actual system to confirm that it was available.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.285-287
• /
• 1999

블록 암호알고리즘에 대한 기존의 연산 모드들(ECB 또는 CBC 등)은, 각 블록에 대하여 동일한 키로 암호화를 수행한다. 이것은 침입자가 한번의 암호 요청만을 수행하여 많은 수의 평문/암호문 쌍을 얻을 수 있게 함으로써 차분해독법 등의 공격에는 안전성을 제공하지 않는다. 본 논문에서는 블록 암호 알고리즘을 위한 새로운 모드를 제안하는데, 이 모드에서는 암호화되는 각각의 블록이 서로 다른 키로 암호화되도록 함으로써 블록의 개수가 많아짐에 따라 안전성 면에서 상당한 이득을 얻게 된다. 각 블록을 위한 서로 다른 키를 생성하는 것이 추가 연산을 필요로 하지만, 제안하는 모드를 DES에 적용한 TDK(a mode for DEA with unTraceable Dynamic Keys)의 수행 시간을 pentium과 sun sparc 상에서 측정해 본 결과 ECB 모드와 거의 유사함을 알 수 있었다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.216-219
• /
• 2002

정보통신의 발달과 인터넷의 확산으로 인해 정보보안의 필요성이 중요한 문제로 대두되면서 여러 종류의 암호 알고리즘이 개발되어 활용되고 있다. Substitution Permutation Networks(SPN)등의 블록 암호 알고리즘에서는 확산선형변환 행렬을 사용하여 안전성을 높이고 있다. 확산선형변환 행렬이 Maximum Distance Separable(MDS) 코드를 생성하면 선형 공격과 차분 공격에 강한 특성을 보인다. 본 논문에서는 선형변환 행렬이 MDS 코드를 생성하는 가를 판단하는 새로운 알고리즘을 제안한다. 입력 코드는 GF(2/sub□/)상의 원소들로 구성되며, 원소를 변수로 해석하여, 변수를 소거시키면서 선형변환행렬이 MDS 코드를 생성하는 가를 판단한다. 본 논문에서 제안한 알고리즘은 종래의 모든 정방 부분행렬이 정칙인가를 판단하는 알고리즘과 비교하여 연산 수행 시간을 크게 줄였다.

• Journal of Broadcast Engineering
• /
• v.27 no.4
• /
• pp.477-486
• /
• 2022

In this paper, we propose a novel intra-prediction method using convolutional neural network (CNN) to improve a quality of a predicted block in VVC. The proposed algorithm goes through a two-step procedure. First, an input prediction block is generated using one of the VVC intra-prediction modes. Second, the prediction block is further refined through a CNN model, by inputting the prediction block itself and reconstructed reference samples in the boundary. The proposed algorithm outputs a refined block to reduce residual signals and enhance coding efficiency, which is enabled by a CU-level flag. Experimental results demonstrate that the proposed method achieves improved rate-distortion performance as compared a VVC reference software, I.e., VTM version 10.0.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2355-2364
• /
• 2012

Recently, the novel loop-up table(N-LUT) method to solve the tremendous memory problem of the conventional look-up table (LUT) method as well as to increase the generation speed of hologram patterns has been proposed. But, as the resolution of an input 3-D object is enhanced, the number of object points to be calculated for generation of its hologram pattern also increases, which results in a sharp increase of the computation time. Therefore, in this paper, a new approach for fast generation of the hologram pattern of 3-D object images is proposed by using the block redundancy feature of 3-D object images and the N-LUT method. Experimental results show that in the proposed method the number of object points and the overall computation time have been reduced by 43.3 % and 47.9 %, respectively compared to those of the conventional method for the case of the $5{\times}5$ block size. These good experimental results finally confirm the feasibility of the proposed method.