• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제41권6호
• /
• pp.663-671
• /
• 2016

According to rapidly increasing of network traffics, necessity of high-speed router also increased. For various purposes, like traffic statistic and security, traffic measurement function should performed by router. However, because of the nature of high-speed router, memory resource of router was limited. RCC proposed a way to measure traffics with high speed and accuracy. Additional quadratic probing hashing table used for accumulating elephant flows in RCC. However, in our experiment, quadratic probing performed many overheads when allocated small memory space or load factor was high. Especially, quadratic requested many calculations in update and lookup. To face this kind of problem, we use a cuckoo hashing which performed a good performance in update and loop for enhancing the RCC. As results, RCC with cuckoo hashing performed high accuracy and speed even when load factor of memory was high.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제38A권4호
• /
• pp.295-302
• /
• 2013

In the network coding, throughput can be increased by allowing the transformation of the received data at the intermediate nodes. However, the adversary can obtain more information at the intermediate nodes and make troubles for decoding of transmitted data at the sink nodes by modifying transmitted data at the compromised nodes. In order to resist the adversary activities, various information theoretic or cryptographic secure network coding schemes are proposed. Recently, a secure network coding based on the cryptographic hash function can be used at the random network coding. However, because of the computational resource requirement for cryptographic hash functions, networks with limited computational resources such as sensor nodes have difficulties to use the cryptographic solution. In this paper, we propose a new secure network coding scheme which uses linear transformations and table lookup and safely transmits n-1 packets at the random network coding under the assumption that the adversary can eavesdrop at most n-1 nodes. It is shown that the proposed scheme is an all-or-nothing transform (AONT) and weakly secure network coding in the information theory.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2005년도 추계종합학술대회
• /
• pp.895-898
• /
• 2005

This paper describes a design of LNS-based divider and square-root circuits which are key arithmetic units in graphic processor and digital signal processor. To achive area-efficient and low-power that is an essential consideration for mobile environment, a fixed-point format of 16.16 is adopted instead of conventional floating-point format. The designed divider and square-root units consist of binary-to-logarithm converter, subtractor, logarithm-to-binary converter. The binary to logarithm converter is designed using combinational logic based on six regions approximation method. As a result, gate count reduction is obtained when compared with conventional lookup approack. The designed units is 3,130 gate count and 1,280 gate count. To minimize average percent error 3.8% and 4.2%. error compensation method is employed.

• Journal of the Korea Institute of Military Science and Technology
• /
• 제23권4호
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제18권11호
• /
• pp.1701-1713
• /
• 1993

This paper proposes a simple and highly effective RACMC(Real-time ATM Cell Monitoring and Control) algorithm and the resulting bandwidth gain effects art considered. RACMC algorithm performs usage parameter controls according to the monitoring informations of input data cells generated from the accepted connections and the controlling informations set by the M/P(Management Plane) for that connection. The results of monitoring and controlling actions for ATM data cells are transmitted to the M/P and the control parameters in lookup table are updated according to the condition of currently used bandwith. Therefore, the proposed algorithm can allocate network resource optimally and solve the several tantalizing problems that the existing cell control algorithm have, that is, the difficulty in controlling as monitoring very bursty traffics, unavoidable processing delay, and limited input buffer size when implemented. By the performance analysis using computer simulation, RACMC algorithm proves to be very effective especially in ATM network as implemented simply.

• Journal of KIISE:Computer Systems and Theory
• /
• 제30권7_8호
• /
• pp.359-369
• /
• 2003

We present efficient generalized algorithms for all-to-all personalized communication operations in a 2D torus. All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, Fast Fourier Transform(FFT), and distributed table lookup. Some algorithms have been Presented when the number of nodes is power-of-2 or multiple-of-four form, but there has been no result for general cases yet. We first present complete exchange algorithm called multiple-Hop-2D when the number of nodes is in the form of multiple-of-two. Then by extending this algorithm, we present two algorithms for an arbitrary number of nodes. Split-and-Merge algorithm first splits the whole network into zones. After each zone performs complete exchange, merge is applied to finish the desired complete exchange. By handling extra steps in Double-Hop-2D algorithm, Modified Double-Hop-2D algorithm performs complete exchange operation for general cases. Finally, we compare the required start-up time for these algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제22권3호
• /
• pp.495-504
• /
• 2012

This paper presents various speed optimization techniques for software implementation of the HIGHT block cipher on CPUs and GPUs. We considered 32-bit and 64-bit operating systems for CPU implementations. After we applied the bit-slicing and byte-slicing techniques to HIGHT, the encryption speed recorded 1.48Gbps over the intel core i7 920 CPU with a 64-bit operating system, which is up to 2.4 times faster than the previous implementation. We also implemented HIGHT on an NVIDIA GPU equipped with CUDA, and applied various optimization techniques, such as storing most frequently used data like subkeys and the F lookup table in the shared memory; and using coalesced access when reading data from the global memory. To our knowledge, this is the first result that implements and optimizes HIGHT on a GPU. We verified that the byte-slicing technique guarantees a speed-up of more than 20%, resulting a speed which is 31 times faster than that on a CPU.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2022년도 춘계학술대회
• /
• pp.115-117
• /
• 2022

Whitebox encryption technique is a method of preventing exposure of encryption keys by mixing encryption key information with a software-based encryption algorithm. Whitebox encryption technique is attracting attention as a technology that replaces conventional hardware-based security encryption techniques by making it difficult to infer confidential data and keys by accessing memory with unauthorized reverse engineering analysis. However, in the encryption and decryption process, a large lookup table is used to hide computational results and encryption keys, resulting in a problem of slow encryption and increased memory size. In particular, it is difficult to apply whitebox cryptography to low-cost, low-power, and light-weight Internet of Things products due to limited memory space and battery capacity. In addition, in a network environment that requires real-time service support, the response delay time increases due to the encryption/decryption speed of the whitebox encryption, resulting in deterioration of communication efficiency. Therefore, in this paper, we analyze whether the AES-based whitebox(WBC-AES) proposed by S.Chow can satisfy the speed and memory requirements based on the experimental results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제44권2호
• /
• pp.46-54
• /
• 2007

In current printer industry, four or more colorants are added for color gamut extension because the gamut of printer is smaller than other devices. However, these additional colorants make a redundancy problem that several combinations of colorants reproduced same color stimulus in colorimetric inverse characterization process. Thus, we propose a method of colorimetric inverse characterization using color correlation between colorant's amount. First, for analyzing the combination of colorants which represent the same color stimulus, we estimate the color stimulus for all combination of colorants by Cellular Yule-Nielsen Spectral Neugebauer printer model. The combination of colorants which has higher color correlation factor comparing combinations of colorant around itself in color space is selected. It can reduced the color difference from the tetrahedral interpolation process which is estimation of the output value(colorants combination) for arbitrary input(color stimulus). The selected combinations of colorants and their color stimulus are stored to the lookup table. In experiment, the CMYKGO printer was used. As a result, the dark region of color gamut was extended and the color tone was more naturally represented.

• Korean Journal of Remote Sensing
• /
• 제33권6_1호
• /
• pp.961-970
• /
• 2017

Despite of large demand for high spatial resolution products of aerosol properties from satellite remote sensing, it has been very difficult due to the weak signal by a single pixel and higher noise from clouds. In this study, aerosol retrieval algorithm with the high spatial resolution ($500m{\times}500m$) was developed using Geostationary Ocean Color Imager (GOCI) data during the Korea-US Air Quality (KORUS-AQ) period in May-June, 2016.Currently, conventional GOCI Yonsei aerosol retrieval(YAER) algorithm provides $6km{\times}6km$ spatial resolution product. The algorithm was tested for its best possible resolution of 500 m product based on GOCI YAER version 2 algorithm. With the new additional cloud masking, aerosol optical depth (AOD) is retrieved using the inversion method, aerosol model, and lookup table as in the GOCI YAER algorithm. In some cases, 500 m AOD shows consistent horizontal distribution and magnitude of AOD compared to the 6 km AOD. However, the 500 m AOD has more retrieved pixels than 6 km AOD because of its higher spatial resolution. As a result, the 500 m AOD exists around small clouds and shows finer features of AOD. To validate the accuracy of 500 m AOD, we used dataset from ground-based Aerosol Robotic Network (AERONET) sunphotometer over Korea. Even with the spatial resolution of 500 m, 500 m AOD shows the correlation coefficient of 0.76 against AERONET, and the ratio within Expected Error (EE) of 51.1%, which are comparable to the results of 6 km AOD.