• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.2
• /
• pp.64-69
• /
• 2010

This paper designs the ABC(Advanced Block Cipher) algorithm which is a 64byte block encryption algorithm, improves the performance of encryption process time, and makes an key exchange using EC-DH. The ABC algorithm reduces basic memory occupation rates using the original data position exchange method which is a data swap key without S-Box, IP-Box and etc. Also, it prepares the exposure of symmetric key using the unfixed encryption(decryption) key excepting the fixed encryption(decryption) key. Therefore, the proposed ABC algorithm in this paper is a proper encryption algorithm in lower memory environment and mobile banking.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.7
• /
• pp.875-880
• /
• 2019

A RC4 stream cipher is widely used for security applications such as IEEE 802.11 WEP, IEEE 802.11i TKIP and so on, because it can be simply implemented to dedicated circuits and achieve a high-speed encryption. RC4 is also used for systems with limited resources like IoT, but there are performance limitations. RC4 consists of two stages, KSA and PRGA. KSA performs initialization and randomization of S-box and K-box and PRGA produces cipher texts using the randomized S-box. In this paper, we initialize the S-box and K-box in the randomization of the KSA stage to reduce the initialization delay. In the randomization, we use clusters to process swap operation between elements of S-box in parallel and can generate two cipher texts per clock. The proposed RC4 cipher hardware can initialize S-box and K-box without any delay and achieves about 2 times to 6 times improvement in KSA randomization and key stream generation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5203-5217
• /
• 2018

In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.

• East Asian Economic Review
• /
• v.19 no.3
• /
• pp.275-322
• /
• 2015

The key objective of this study is to investigate the return and volatility spillover effects among stock market, credit default swap (CDS) market and foreign exchange market for three countries: Korea, the US and Japan. Using the trivariate VAR BEKK GARCH (1,1) model, the study finds that there are significant return and volatility spillover effects between the Korean CDS market and the Korean stock market. In addition, the return spillover effects from foreign exchange markets and the US stock market to the Korean stock market, and the volatility spillover effect from the Japanese stock market to the Korean stock market are both significant.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1611-1633
• /
• 2022

At EUROCRYPT 2019, a new block cipher algorithm called BISON was proposed by Canteaut et al. which uses a novel structure named as Whitened Swap-Or-Not (WSN). Unlike the traditional wide trail strategy, the differential and linear properties of this algorithm can be easily determined. However, the encryption speed of the BISON algorithm is quite low due to a large number of iterative rounds needed to ensure certain security margins. Commonly, denoting by n is the data block length, this design requires 3n encryption rounds. Moreover, the block size n of BISON is always odd, which is not convenient for operations performed on a byte level. In order to overcome these issues, we propose a new block cipher, named DBISON, which more efficiently employs the ideas of double layers typical to the BISON-like construction. More precisely, DBISON divides the input into two parts of size n/2 bits and performs the round computations in parallel, which leads to an increased encryption speed. In particular, the data block length n of DBISON can be even, which gives certain additional implementation benefits over BISON. Furthermore, the resistance of DBISON against differential and linear attacks is also investigated. It is shown the maximal differential probability (MDP) is 1/2^n-1 for n encryption rounds and that the maximal linear probability (MLP) is strictly less than 1/2^n-1 when (n/2+3) iterative encryption rounds are used. These estimates are very close to the ideal values when n is close to 256.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.94-101
• /
• 2015

The display device is an important video information communication system device to connect between human and device. it transfers the information as characters, shapes, images and pattern to enable recognizing by eyes. Theres absolutely needs some key functions and role to quickly display informations. It can analyse a information through a PPI Scope of a cathode-ray tube(CRT) displays information which can perform a role. this research proposed a radar device to display informations as received signal. The radar display researches can apply to fixed function graphics pipeline algorithms of the large capacity type through a vertical blanking interval and buffer swap of display unit. Also, it can be possible to apply to performed algorithms to FPGA logic without high-performance graphics processing unit GPU through synchronization which can implement a display system. In this paper, we improved the affordability and reliability through proposed research. 이So, we have studied the radar display unit which can change a flat display from radar display of CRT radar display.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.10
• /
• pp.4359-4368
• /
• 2011

Among several macroeconomic missteps blamed for the recent global financial crisis including the social problems of income distribution and the lack of proper financial remedies, two of them have received particular attention: the global BOP(Balance of Payment) imbalance and the misguided monetary policy. Such BOP imbalance was blamed for massive foreign exchange investment flows from Asia into the U.S., triggering the financial and real estate bubble in America. The latter refers to the excessively loose monetary policy of the U.S. Federal Reserve, which pushed financial institutions and households into reckless investment behavior in search of higher returns. Given the abuse of certain innovative financial techniques and new investment instruments that have been created in recent decades, both collateralized debt obligations (CDOs) and credit default swaps (CDS) enjoyed a symbiotic and toxic relationship prior to the financial crisis This paper is organized as follows: The first section analyzes the real causes of the recent financial crisis. The second details the role of CDOs and CDS. Then, to identify key determinants of the CDS spreads in an emerging capital market, the sample data of major Korean firms' CDS spreads are used to estimate the risk premium by utilizing the multiple regression analysis. The empirical test result indicates that Korean 3-year treasury bond rate(TYIELD), market to book value ratio(MV/BV), and assets size(INASSETS) are shown to demonstrate statistically significant influences on the changes of the CDS premium for sample firms.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.139-145
• /
• 2012

Generally, Quicksort selects the pivot from leftmost, rightmost, middle, or random location in the array. This paper suggests Quicksort using middle range pivot $P_0$ and continually divides into 2. This method searches the minimum value $L$ and maximum value $H$ in the length n of list $A$. Then compute the initial pivot key $P_0=(H+L)/2$ and swaps $a[i]{\geq}P_0$,$a[j]<P_0$ until $i$=$j$ or $i$>$j$. After the swap, the length of list $A_0$ separates in two lists $a[1]{\leq}A_1{\leq}a[j]$ and $a[i]{\leq}A_2{\leq}a[n]$ and the pivot values are selected by $P_1=P_0/2$, $P_2=P_0+P_1$. This process repeated until the length of partial list is two. At the length of list is two and $a$[1]>$a$[2], swaps as $a[1]{\leftrightarrow}a[2]$. This method is simpler pivot key process than Quicksort and improved the worst-case computational complexity $O(n^2)$ to $O(n{\log}n)$.