• Journal of information and communication convergence engineering
• /
• 제2권3호
• /
• pp.182-186
• /
• 2004

When most of existing instant messengers log on server, they transmit to sever in encoding password to RC5. but RC5 don't be secured because it has been known many of password cracking tools. Also, messengers don't have any protection on the transmitted information with communicating two hosts since loging on, endangering the privacy of the user. As a counter measure, messengers need to provide security service including message encryption. In this paper, we designed a key exchange method of password representing fast, effective and high security degree, using ECC(Elliptic Curve Cryptography) that being known the very stronger than another public key cryptography with same key size. To effectively improve data transmission and its security using IPSec protocol between users, tunnel mode is introduced. Tunnel mode transmits Host-to-Host data through virtual pipelines on the Internet.

• International Journal of Computer Science & Network Security
• /
• 제21권3호
• /
• pp.60-70
• /
• 2021

In this paper we study the problem of implementation of security issues of blue tooth, especially secure simple pairing, with the help of an efficient four user authenticated key (4UAK) for an elliptic curve cryptography (ECC). This paper also deals with the design, implement and performance evaluation of secure simple pairing (SSP) using an elliptic curve cryptography, such as Diffie Hellman protocol when four users are involved. Here, we also compute the best, worst and average case step counts (time complexities). This work puts forth an efficient way of providing security in blue tooth. The time complexity of O(n⁴) is achieved using Rabin Miller Primality methodology. The method also reduces the calculation price and light communication loads.

• International Journal of Internet, Broadcasting and Communication
• /
• 제8권1호
• /
• pp.64-68
• /
• 2016

These fields are integrated to visualize and finalize the proposed development, in simulation environment. SCADA (supervisory control and data acquisition) systems and distributed control systems (DCSs) are widely deployed in all over the world, which are designed to control the industrial infrastructures, in real ways. To supervise and control the various parts of designed systems; trends to require a deep knowledge to understand the overall functional needs of industries, which could be a big challenge. Industrial field devices (or network sensors) are usually distributed in many locations and are controlled from centralized site (or main control center); the communication provides various signs of security issues. To handle these issues, the research contribution will twofold: a method using cryptography is deployed in critical systems for security purposes and overall transmission is controlled from main controller site. At controller site, multimedia components are employed to control the overall transmission graphically, such as system communication, bytes flows, security embedded parameters and others, by the means of multimedia technology.

• 정보보호학회논문지
• /
• 제31권1호
• /
• pp.99-109
• /
• 2021

최근 정보통신기술의 발전으로 통신망을 통하여 소통하는 정보가 증가하고 있으며, 이를 보호하기 위한 기반기술로 암호가 널리 활용되고 있다. 한편, 초창기 암호기술은 군사적 활용을 목적으로 개발되어 국가가 조정·통제하였으나, 정보통신기술의 향상에 따라 민간으로 상당 부분 이전되어 발전되고 있다. 이로 인해, 세계 각 국에서는 민간영역의 암호이용 자유화에 대한 요구와 국가차원의 암호 활용 권한 우위를 두고 마찰이 발생하여 왔다. 본 논문에서는 각 국의 암호 정책 수립과정에서 나타난 국가와 민간의 갈등을 살펴보고 국내의 암호정책 현실을 알아보았다. 이를 바탕으로 균형 있는 암호정책의 적용과 암호산업 발전을 도모하며, 국가의 암호접근 권한을 확보하기 위하여 국가 암호해독 전문기관 설립 필요성과 암호 부정사용에 대한 법적 제재 방안의 입법 필요성을 제시한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.975-978
• /
• 2002

A new conception of public-key cryptography MEPKC, Petri net based Multi-stage-Encryption Public-Key Cryptography, has been proposed in onder to guarantee stronger network communication security. Different from an ordinary public-key cryptography that opens only a single public key to the public, MEPKC opens a key-generator that can generate multiple encryption keys and uses these keys to encrypt a plain text to a cipher text stage by stage. In this paper, we propose the methods how to carry out the encryption operations. First, we describe how to design a hash function H that is used to conceal the encryption keys from attack. Then, given with a key-generator (a Petri net supposed to possess a large number of elementary T-invariants), we discuss how to randomly generate a series of encryption keys, the elementary T-invariants. Finally, we show how to use these encryption keys to encrypt a plain text to a cipher text by applying a private key cryptography, say DES.

• 한국IT서비스학회지
• /
• 제3권2호
• /
• pp.119-127
• /
• 2004

A mobile ad hoc network(MANET) is a network where a set of mobile devices communicate among themselves using wireless transmission without the support of a fixed network infrastructure. The use of wireless links makes MANET susceptible to attack. Eavesdroppers can access secret information, violating network confidentiality, and compromised nodes can launch attack from within a network. Therefore, the security for MANET depends on using the cryptographic key, which can make the network reliable. In addition, because MANET has a lot of mobile devices, the authentication scheme utilizing only the symmetric key cryptography can not support a wide range of device authentication. Thereby, PKI based device authentication technique in the Ad Hoc network is essential and the paper will utilize the concept of PKI. Especially, this paper is focused on the key management technique of PKI technologies that can offer the advantage of the key distribution, authentication, and non-reputation, and the issuing and managing technique of certificates based on clustering using Threshold Cryptography for secure communication in MANET.

• 디지털융복합연구
• /
• 제12권8호
• /
• pp.243-248
• /
• 2014

IPSec은 네트워크상에서 안전한 통신환경을 제공하기 위해 사용하는 보안 프로토콜로, 헤더 인증(Authentication Header)과 데이터와 송신자를 인증하는 Encapsulating Security Payload (ESP) 서비스를 제공하며, 이에 대한 기본적인 개념과, IPSec의 종류를 알아보고 활용되는 방법에 대해서 조사하였다. IPSec 프로토콜이 악용되었을 때의 문제점과 그에 대한 대응책을 알아보고 IPSec을 통한 DDoS 공격에 대한 해결방법을 제시하여 IPSec 프로토콜 사용을 통한 안전한 통신환경을 구축하고자 한다.

• 한국정보통신학회논문지
• /
• 제18권1호
• /
• pp.84-90
• /
• 2014

비밀통신의 발전은 아날로그 통신에서 디지털 통신으로 진보해 왔다. 디지털통신상의 비밀통신은 one-time pad의 안전성을 승계하여 주로 설계 되어 왔다. One-time pad의 안전성은 상호 보관하는 비밀키의 안전성에 기인하고 비밀키의 교환에 의한 상호 동기화가 가장 중요한 요소이다. 본 논문에서는 quantum cryptography system 중 BB84 알고리즘의 수학적 안전도를 살펴보고 이를 이용하여 양자 키 전송을 시행한다. 생성된 키는 개인의 각 단말에서 AES의 64번 라운드를 시행한 ciphertext을 상호 교환하는 One-time Pad 형 알고리즘을 제안한다.

• 한국정보통신학회논문지
• /
• 제19권12호
• /
• pp.2865-2870
• /
• 2015

최근 양자 컴퓨터가 개발되는 등 컴퓨팅 하드웨어의 성능이 발전하면서 단시간 내에 처리할 수 있는 정보의 양이 기하급수적으로 증가하고 있다. Koblitz-Fellows가 제안한 암호시스템은 생성할 수 있는 불변 다항식(invariant polynomial)의 개수가 충분하지 않아 특정 3-정규 그래프에서 완전지배집합(Perfect Dominating Set, PDS)을 찾는 문제가 NP-complete임을 보장할 수 없는 문제점이 발생한다. 본 논문에서는 이러한 취약점을 보완하기 위해 Koblitz-Fellows가 제안한 3-정규 그래프 상에서 완전지배집합을 이용하여 불변 다항식의 개수를 기하급수적으로 증가시킴으로 계산의 복잡도를 더욱 난해하게 하여 암호시스템의 취약점을 개선하도록 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2680-2700
• /
• 2017

Finite field arithmetic over GF($2^m$) is used in a variety of applications such as cryptography, coding theory, computer algebra. It is mainly used in various cryptographic algorithms such as the Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES), Twofish etc. The multiplication in a finite field is considered as highly complex and resource consuming operation in such applications. Many algorithms and architectures are proposed in the literature to obtain efficient multiplication operation in both hardware and software. In this paper, a modified serial multiplication algorithm with interleaved modular reduction is proposed, which allows for an efficient realization of a sequential polynomial basis multiplier. The proposed sequential multiplier supports multiplication of any two arbitrary finite field elements over GF($2^m$) for generic irreducible polynomials, therefore made versatile. Estimation of area and time complexities of the proposed sequential multiplier is performed and comparison with existing sequential multipliers is presented. The proposed sequential multiplier achieves 50% reduction in area-delay product over the best of existing sequential multipliers for m = 163, indicating an efficient design in terms of both area and delay. The Application Specific Integrated Circuit (ASIC) and the Field Programmable Gate Array (FPGA) implementation results indicate a significantly less power-delay and area-delay products of the proposed sequential multiplier over existing multipliers.