• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.1-10
• /
• 2001

In this paper, we define requirements for call distribution of service control logic in Intelligent Network, Also, we propose call distribution mechanism for every subscriber with different call distribution rates, The call distribution mechanism had been developed as a function of Premium-rate Service in Intelligent Network. Our call distribution mechanism applies to percentage distribution instead of circular or hierarchical distribution. The call distribution mechanism consists of call input. output. call distribution processing logic part, random number generator, and customers database. We propose the practical implementation of a call distribution mechanism and call distribution decision indicating number computation method. We show three methods, the rand() function in C language, microsecond by system clock, and proposed algorithm, to get call distribution decision indicating number. In order to optimal call distribution mechanism, we estimated the results of three methods on occurrence values and the number of occurrences.

• Korean Journal of Optics and Photonics
• /
• v.22 no.2
• /
• pp.83-89
• /
• 2011

In order to improve the calculation speed of an integrating-sphere simulator based on a ray-tracing method, parallel processing with OpenMP directive was implemented into the simulator and the randomness of Monte Carlo method was guaranteed by utilizing a parallel random number generator. It was confirmed that simulation results obtained with more than $10^7$ rays showed good agreement with theoretical results within the error range of 0.5%, and that the calculation speed improved as the number of threads increased. Finally, the spatial response distribution functions of a real integrating sphere were simulated and compared with previous results.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.3
• /
• pp.501-507
• /
• 2015

The online banking service handles a banking business over the internet, it is necessary to ensure that all financial transactions are processed securely. So, there are various authentication technique for e-banking service : a certificate, a personal identification number(PIN), a security card and a one-time password(OTP). Especially, the security card is most important means including secret information. If the secret information of card is leaked, it means not only loss of security but also easy to attack because security card is a difficult method to get. In this paper, we propose that a multi-channel security card saves an secret information in distributed channel. Proposed multi-channel security card reduces vulnerability of the exposed and has a function to prevent phishing attacks through decreasing the amount of information displayed and generating secret number randomly.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.1
• /
• pp.84-91
• /
• 2001

In in vitro cell experiments for the biological assessment of electromagnetic (EM) field, exposure system (ES) must be analyzed in terms of current density (J) and induced electric field intensity (E). Although in uniform B field, E and J in the sample medium are not distributed uniformly because of conductivity in sample dish. Thus, the precise estimation for E and J induced by uniform ELF within sample media is very important keys for successful in in vitro experiments. In this paper, we designed in vitro ELF ES with electromagnetic analysis using MATLAB simulator. Then we calculated from the measured B field to verify induced E & J distribution for random locations of cells within media in two cases of samples existence or not. ES with B field ranging from 0 to 20G consists of Helmholz coil and current generator based on the microprocessor. Also, we developed ELFES for each B field generation as uniform and non-uniform modes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.771-780
• /
• 2020

QKD(Quantum Key Distribution) is one of the protocols that can make two distant parties safely share secure keys against the threat of quantum computer. Generally, cryptographic applications which are connected to the QKD device have fixed roles as a transmitter and a receiver due to the race condition and complexity of implementation. Because the conventional QKD system is mainly applied to the link encryptor, there are no problems even if the roles of the cryptographic devices are fixed. We propose a new scheme of QKD system and protocol that is easy to extend to the QKD network by eliminating quantum key dependency between cryptographic device and QKD node. The secure keys which are generated by the TRNG(True Random Number Generator) are provided to the cryptographic applications instead of quantum keys. We design an architecture to transmit safely the secure keys using the inbound and outbound quantum keys which are shared between two nodes. In this scheme, since the dependency of shared quantum keys between two QKD nodes is eliminated, all cryptographic applicatons can be a master or a slave depending on who initiates the cryptographic communications.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1759-1769
• /
• 1997

The Error BackPropagation (EBP) algorithm for multi-layered neural networks is widely used in various areas such as associative memory, speech recognition, pattern recognition and robotics, etc. Nevertheless, many researchers have continuously published papers about improvements over the original EBP algorithm. The main reason for this research activity is that EBP is exceeding slow when the number of neurons and the size of training set is large. In this study, we developed new learning speed acceleration methods using variable learning rate, variable momentum rate and variable slope for the sigmoid function. During the learning process, these parameters should be adjusted continuously according to the total error of network, and it has been shown that these methods significantly reduced learning time over the original EBP. In order to show the efficiency of the proposed methods, first we have used binary data which are made by random number generator and showed the vast improvements in terms of epoch. Also, we have applied our methods to the binary-valued Monk's data, 4, 5, 6, 7-bit parity checker and real-valued Iris data which are famous benchmark training sets for machine learning.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1470-1476
• /
• 2020

This paper describes a design of a lightweight security system-on-chip (SoC) suitable for the implementation of security protocols for IoT and mobile devices. The security SoC using Cortex-M0 as a CPU integrates hardware crypto engines including an elliptic curve cryptography (ECC) core, a SHA3 hash core, an ARIA-AES block cipher core and a true random number generator (TRNG) core. The ECC core was designed to support twenty elliptic curves over both prime field and binary field defined in the SEC2, and was based on a word-based Montgomery multiplier in which the partial product generations/additions and modular reductions are processed in a sub-pipelining manner. The H/W-S/W co-operation for elliptic curve digital signature algorithm (EC-DSA) protocol was demonstrated by implementing the security SoC on a Cyclone-5 FPGA device. The security SoC, synthesized with a 65-nm CMOS cell library, occupies 193,312 gate equivalents (GEs) and 84 kbytes of RAM.

• Nutrition Research and Practice
• /
• v.15 no.1
• /
• pp.95-105
• /
• 2021

BACKGROUND/OBJECTIVES: The measurement of body composition, including muscle and fat mass, remains challenging in large epidemiological studies due to time constraint and cost when using accurate modalities. Therefore, this study aimed to develop and validate prediction equations according to sex to measure lean body mass (LBM), appendicular skeletal muscle mass (ASM), and body fat mass (BFM) using anthropometric measurement, serum creatinine level, and lifestyle factors as independent variables and dual-energy X-ray absorptiometry as the reference method. SUBJECTS/METHODS: A sample of the Korean general adult population (men: 7,599; women: 10,009) from the Korean National Health and Nutrition Examination Survey 2008-2011 was included in this study. The participants were divided into the derivation and validation groups via a random number generator (with a ratio of 70:30). The prediction equations were developed using a series of multivariable linear regressions and validated using the Bland-Altman plot and intraclass correlation coefficient (ICC). RESULTS: The initial and practical equations that included age, height, weight, and waist circumference had a different predictive ability for LBM (men: R2 = 0.85, standard error of estimate [SEE] = 2.7 kg; women: R2 = 0.78, SEE = 2.2 kg), ASM (men: R2 = 0.81, SEE = 1.6 kg; women: R2 = 0.71, SEE = 1.2 kg), and BFM (men: R2 = 0.74, SEE = 2.7 kg; women: R2 = 0.83, SEE = 2.2 kg) according to sex. Compared with the first prediction equation, the addition of other factors, including serum creatinine level, physical activity, smoking status, and alcohol use, resulted in an R2 that is higher by 0.01 and SEE that is lower by 0.1. CONCLUSIONS: All equations had low bias, moderate agreement based on the Bland-Altman plot, and high ICC, and this result showed that these equations can be further applied to other epidemiologic studies.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.1
• /
• pp.35-42
• /
• 2001

The primitive polynomial on GF(q) is used in the area of the scrambler, the error correcting code and decode, the random generator and the cipher, etc. The algorithm that generates efficiently the primitive polynomial on GF(q) was proposed by A.D. Porto. The algorithm is a method that generates the sequence of the primitive polynomial by repeating to find another primitive polynomial with a known primitive polynomial. In this paper, we propose the algorithm that is improved in the A.D. Porto algorithm. The running rime of the A.D. Porto a1gorithm is O($\textrm{km}^2$), the running time of the improved algorithm is 0(m(m+k)). Here, k is gcd(k, $q^m$-1). When we find the primitive polynomial with m odor, it is efficient that we use the improved algorithm in the condition k, m>>1.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.123-134
• /
• 2004

In this paper a high speed architecture of the RC4 stream cipher is proposed and its FPGA implementation is presented. Compared to the conventional RC4 designs which have long initialization operation or use double or triple S-arrays to reduce latency delay due to S-array initialization phase, the proposed architecture for RC4 stream cipher eliminates the S-array initialization operation using 256-bit valid entry scheme and supports 40/128-bit key lengths with efficient modular arithmetic hardware. The proposed RC4 stream cipher is implemented using Xilinx XCV1000E-6H240C FPGA device. The designed RC4 stream cipher has about a throughput of 106 Mbits/sec at 40 MHz clock and thus can be applicable to WEP processor and RC4 key search processor.