• 한국통신학회논문지
• /
• 제26권5B호
• /
• pp.554-560
• /
• 2001

통신망의 급격한 발전과 통신 속도의 향상에 따라 암호 알고리듬의 고속화 필요성이 절실하다. 본 논문에서는 LFSR을 고속화하기 위하여 한 클럭에 m번의 이동이 이루어지는 고속 병렬형 PS-LFSR을 제안하였고, 이를 기본으로 다수의 키 수열 발생기를 병렬 연결하여 속도를 개선시킨 병렬형 스트림 암호를 제안하였다. 그리고 병렬형 스트림 암호 예로서 m-병렬 합산 수열 발생기(m-parallel SUM-BSG)를 제안하여 m=8인 병렬 발생기를 세부 설계 예시하였으며, 제안된 발생기는 기존의 비도 수준을 유지하면서 처리 속도를 m배 높을 수 있음을 확인하였다.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2003년도 동계학술대회
• /
• pp.399-405
• /
• 2003

A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in an NTRU lattice was proposed in［7］,［8］. However no security proof against chosen messages attack has been made for this scheme. In this paper, we show that NTRUSign signature scheme contains the weakness of malleability. From this, one can derive new valid signatures from any previous message-signature pair which means that NTRUSign is not secure against strongly existential forgery.

• 한국통신학회논문지
• /
• 제35권7B호
• /
• pp.1050-1057
• /
• 2010

오늘날 네트워크에 대한 침해사고가 급증하고 있으며, 점차 증가하고 있는 인바운드 네트워크에 대한 공격도 함께 증가하고 있다. 이러한 공격에 대응하기 위해서 보안시스템의 개발이 지속적으로 이뤄지고 있지만, 인바운드 네트워크의 성능 감소의 문제가 발생하기 때문에, 성능 향상과 보안성 강화를 위한 모두를 고려한 보안시스템 개발이 시급한 실정이다[1]. 따라서 본 논문에서는 네트워크를 분할하여 보안등급에 따라 관리함으로써 성능을 향상 시키기 위한 보안클러스터링을 제안하고자 한다.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 1996년도 종합학술발표회논문집
• /
• pp.326-335
• /
• 1996

In this paper, we quantify the tradeoff between security and performance in secure data communication systems based on the queueing theory, and propose the optimization methods, such as the preprocessing, a message segmentation, compression, integration of compression and encryption and integration of user authentication and access control, which are able to reduce the delay induced by the security mechanisms and protocols. Moreover, we analyze the average delay for the secure data communication systems through the computer simulations, which are modeled by M/M/1, M/E$_2$/1 and M/H$_2$/1 queueing systems, respectively. We consider the DES, RSA digital signature and the combination of IDEA and RSA as security mechanisms for applying security services.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.718-720
• /
• 1999

Chua's circuit is a simple electronic network which exhibits a variety of bifurcation and attractors. The circuit consists of two capacitors, an inductor, a linear resistor. and a nonlinear resistor. In this paper, a transmitter and a receiver using two identical Chua's circuits are proposed and a equivalent wire secure communications are investigated. A secure communication method in which the desired information signal is synthesized with the chaos signal created by the Chua's circuit is proposed and information signal is demodulated also using the Chua's circuit. The proposed method is synthesizing the desired information with the chaos circuit by adding the information signal to the chaos signal in the wire transmission system.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.166-169
• /
• 2000

Chua's circuit is a simple electronic network which exhibits a variety of bifurcati on and attractors. The circuit consists of two capacitors, an inductor, a linear resistor, and a nonlinear resistor. In this paper, a transmitter and a receiver using two identical Chua's circuitsare proposed and a transmission secure communications are investigated. A secure communication method in which the desired information signal is synthesized with the chaos signal created by the Chua's circuit is proposed and information signal is demodulated also using the Chua's circuit. The proposed method is synthesizing the desired information with the chaos circuit by adding the information signal to the chaos signal in the power lime.

• 융합보안논문지
• /
• 제5권4호
• /
• pp.49-58
• /
• 2005

환자의 이동성과 경제적인 의료서비스를 제공하는 미래의 원격의료시스템으로서 유비쿼터스 센서 네트워크(USN) 구조를 제시한다. 본 USN 구조는 계층적 라우팅과 평면 라우팅을 접합하여 개선한 것으로서 멀티캐스팅 통신을 지원하는 셀 기반의 안전한 4계층 구조이다. 본 구조에서는 환자의 개인정보 보호 및 안전한 의료정보를 위하여 경량의 PKI 기반 보안 통신 프로토콜을 채택하고 있으며 이에 따른 핵심 통신 과정을 함께 제시하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.2407-2409
• /
• 2000

Chua's circuit is a simple electronic network which exhibits a variety of bifurcation and attractors. The circuit consists of two capacitors, an inductor, a linear resistor, and a nonlinear resistor. In this paper, a transmitter and a receiver using two identical Chua's circuits are proposed and a equivalent T type wire secure communications are investigated. A secure communication method in which the desired information signal is synthesized with the chaos signal created by the Chua's circuit is proposed and information signal is demodulated also using the Chua's circuit. The proposed method is synthesizing the desired information with the chaos circuit by adding the information signal to the chaos signal in the wire transmission system.

• 중소기업융합학회논문지
• /
• 제4권4호
• /
• pp.19-23
• /
• 2014

Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, the integrity of messages, member authentication, and confidentiality must be provided among group members. To maintain message integrity, all group members use the Group Key (GK) for encrypting and decrypting messages while providing enough security to protect against passive attacks. Tree-based Group Diffie-Hellman (TGDH) is an efficient group key agreement protocol to generate the GK. TGDH assumes all members have an equal computing power. One of the characteristics of distributed computing and grid environments is heterogeneity; the member can be at a workstation, a laptop or even a mobile computer. Member reordering in the TDGH protocol could potentially lead to an improved protocol; such reordering should capture the heterogeneity of the network as well as latency. This research investigates dynamic reordering mechanisms to consider not only the overhead involved but also the scalability of the proposed protocol.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.1-7
• /
• 2013

Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested lattice-based proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure ID-based proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.