• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.371-374
• /
• 2001

본 논문에서는 셀룰라 오토마타(Cellular Automata : CA)를 이용한 다항식 모듈라 멱승 알고리즘을 제안한다. 또한 이를 이용하여 공개키 암호 알고리즘인 EiGamal 알고리즘을 구현한다. 기존의 모듈라 멱승 알고리즘은 대부분 선형 귀환 시프트 레지스트(Linear Feedback Shift Register : LFSR)를 이용하여 구현하였다. 그러나 LFSR을 이용한 구조는 기저가 자주 변경되는 연산에 대하여 구현하기에 곤란한 단점을 가지고 있다. 본 논문에서 제안된 알고리즘은 CA의 병렬성과 높은 적응성을 이용함으로써 기저가 자주 변경되는 멱승 연산 알고리즘에 쉽게 적용할 수 있는 장점이 있다.

• Progress in Medical Physics
• /
• v.27 no.4
• /
• pp.180-188
• /
• 2016

Acuros XB advanced dose calculation algorithm (AXB, Varian Medical Systems, Palo Alto, CA) has been released recently and provided the advantages of speed and accuracy for dose calculation. For clinical use, it is important to investigate the dosimetric performance of AXB compared to the calculation algorithm of the previous version, Anisotropic Analytical Algorithm (AAA, Varian Medical Systems, Palo Alto, CA). Ten volumetric modulated arc therapy (VMAT) plans for each of the following cases were included: head and neck (H&N), prostate, spine, and lung. The spine and lung cases were treated with stereotactic body radiation therapy (SBRT) technique. For all cases, the dose distributions were calculated using AAA and two dose reporting modes in AXB (dose-to-water, $AXB_w$, and dose-to-medium, $AXB_m$) with same plan parameters. For dosimetric evaluation, the dose-volumetric parameters were calculated for each planning target volume (PTV) and interested normal organs. The differences between AAA and AXB were statistically calculated with paired t-test. As a general trend, $AXB_w$ and $AXB_m$ showed dose underestimation as compared with AAA, which did not exceed within -3.5% and -4.5%, respectively. The maximum dose of PTV calculated by $AXB_w$ and $AXB_m$ was tended to be overestimated with the relative dose difference ranged from 1.6% to 4.6% for all cases. The absolute mean values of the relative dose differences were $1.1{\pm}1.2%$ and $2.0{\pm}1.2%$ when comparing between AAA and $AXB_w$, and AAA and $AXB_m$, respectively. For almost dose-volumetric parameters of PTV, the relative dose differences are statistically significant while there are no statistical significance for normal tissues. Both $AXB_w$ and $AXB_m$ was tended to underestimate dose for PTV and normal tissues compared to AAA. For analyzing two dose reporting modes in AXB, the dose distribution calculated by $AXB_w$ was similar to those of AAA when comparing the dose distributions between AAA and $AXB_m$.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.1
• /
• pp.101-105
• /
• 2014

Background and Purpose: Human epididymis protein 4 (HE4) has been suggested to be a novel biomarker of epithelial ovarian cancer (EOC). The present study aimed to evaluate and compare HE4 with the commonly used marker, carbohydrate antigen 125 (CA125), in prediction and therapy-monitoring of EOC. Patients and Methods: Serum HE4 concentrations from 123 ovarian cancer patients and 174 controls were measured by Roche electrochemiluminescent immunoassay (ECLIA). Risk of ovarian malignancy algorithm (ROMA) values were calculated and assessed. In addition, the prospects of HE4 detection for therapy-monitoring were evaluated in EOC patients. Results: The ROMA score could classify patients into high- and low-risk groups with malignancy. Indeed, lower serum HE4 was significantly associated with successful surgical therapy. Specifically, 38 patients with EOC exhibited a greater decline of HE4 compared with CA125. In contrast, elevation of HE4 better predicted recurrence (of 46, 11 patients developed recurrence, and with it increased HE4 serum concentrations) and a poor prognosis than CA125. Conclusions: This study suggests that serum HE4 levels are closely associated with outcome of surgical therapy and disease prognosis in Chinese EOC patients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1050-1057
• /
• 2008

Wireless Mesh Networks (WMNs) have recently become a hot issue to support high link capacity in wireless access networks. The IEEE 802. I 1 standard which is mainly used for the network interface technology in WMNs supports up to 3 or 12 multiple channels according to the IEEE 802.11 specification. However, two important problems must be addressed when we design a channel assigmnent algorithm: channel dependency problem and channel scanning delay. The former occurs when the dynamic channel switching of an interface leads to the channel switching of other interfaces to maintain node connectivity. The latter happens per channel switching of the interface, and affects the network performance. Therefore, in this paper, we propose the Distance-Based Channel Assigmnent (DB-CA) scheme for multi-channel WMNs to solve such problems. In DB-CA, nodes just perform channel switching without channel scanning to communicate with neighboring nodes that operate on different channels. Furthermore, DB-CA minimizes the interference of channels being used by nodes near the gateway in WMNs. Our simulation results show that DB-CA achieves improved performance in WMNs.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.121-125
• /
• 2000

본 논문은 자동차 등에 사용중인 원격 잠금장치등과같은 간단한 응용에 적합한 고속동작이 가능하면서 암호학적으로 안전한 새로운 스트림 암호 알고리즘을 제안한다. 스트림 암호 알고리즘에 많이 적용되고 있는 피드백 쉬프트 레지스트(LFSR) 에 비하여 암호학적으로 복잡한 천이 과정을 갖는다는 알려져 있는 셀룰라 오토마타(CA)를 이용하여 의사 랜덤 비트 스트림 생성기 (PRNG)를 구성하였다. 또한 제안된 PRNG 의 안전성 평가를 위해 출력 2진 비트 스트림에 대하여 통계적 검정과 스트립 암호 시스템의 평가를 수행한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.681-685
• /
• 2001

본 논문에서는 난수 발생기로써 랜덤성이 우수하고 하드웨어 설계시 고속성이 보장되어 LFSR(Linear Feedback Shift register) 대안으로 소개되고 있는 셀룰라 오토마타(CA: Cellular Automata)를 소개하고 이를 이용한 새로운 블록 암호 알고리즘을 제안한다. 제안된 블록 암호 알고리즘은 Fiestel 구조로써 라운드 함수와 키 스케쥴링 모두를 셀룰러 오토마타를 이용하여 구성함으로써 구현의 편이성과 고속성을 추구하였다. 제안 알고리즘에 대한 간단한 통계적 검정과 성능평가를 통해 기존 표준 알고리즘고의 비교를 수행하였다.

• Journal of Industrial Technology
• /
• v.21 no.B
• /
• pp.75-83
• /
• 2001

In the field of secure information systems including electronic commerces, public key infrastructure(PKI) is widely used for secure services. The more PKI domains are established, the more needs are required for cross-domain certifications. Furthermore, each country has many certificate authorities(CA) which require more complex cross certification: We may need a fast algorithm in order to find the possible certification paths. This will be more indispensible in the growing PKI systems. We designed and implemented the high-speed certification path discovery algorithm. Also, we investigated the feature of operation of the system.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.176-183
• /
• 1999

Using Asynchronous Transfer Mode(ATM) which is a high-bandwidth, low-delay, cell switching and multiplexing technology, Broadband-Integrated Services Digital Network (B-ISDN) can support communication services of all kinds. To evaluate the performance of ATM networks, traffic source models to meet the requirements are demanded. We can obtain random traffic distribution for ATM networks by using the Cellular Automata (CA) which have effective random pattern generation capability. In this paper we propose an algorithm using 2-D LHCA to generate more effective random patterns with good random characteristics. And we show that the randomness by 2-D LHCA is better than that of the randomness by 1-D LHCA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.149-153
• /
• 2003

네트워크를 설계하고 서비스를 구현하는데 있어서 중요한 변수중의 하나는 트래픽의 특성을 파악하는 것이다. 트래픽 특성에 관한 최근의 실험적 연구들은 기존의 모델들이 실제 트래픽의 특성을 제대로 나타낼 수 없다는 것을 지적해 왔고 최근 실제 트래픽 모델과 유사한 모델로서 자기 유사한 특성을 이용한 접근법이 대두되고 있다. 따라서, 본 논문에서는 실제 트래픽과 유사한 자기 유사 데이터 트래픽을 백그라운드 부하로 발생시켜 기존의 ABR(Available Bit Rate) 혼잡제어 알고리즘 중 fairshare을 지원하는 대표적인 EPRCA(Enhanced Proportional Rate Control Algorithm), ERI-CA(Explicit Rate Indication for Congestion Avoidance), NIST(National Institute of Standards and Technology) 스위치 알고리즘이 버스트한 트래픽에 대해 효율적으로 fairshare을 할당하는지를 알아 보았다.

• Journal of Korea Multimedia Society
• /
• v.24 no.3
• /
• pp.406-415
• /
• 2021

The worldwide spread of the Internet and the digital information revolution have resulted in a rapid increase in the use and transmission of multimedia information due to the rapid development of communication technologies. It is important to protect images in order to prevent problems such as piracy and illegal distribution. To solve this problem, I propose a new digital color image encryption algorithm in this paper. I design a new pseudo-random number generator based on 1D five-neighborhood maximum length cellular automata (FN-MLCA) to change the pixel values of the plain image into unpredictable values. And then I use a 3D chaotic cat map to effectively shuffle the positions of the image pixel. In this paper, I propose a method to construct a new MLCA by modeling 1D FN-MLCA. This result is an extension of 1D 3-neighborhood CA and shows that more 1D MLCAs can be synthesized. The safety of the proposed algorithm is verified through various statistical analyses.