• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.6
• /
• pp.205-212
• /
• 2015

SSH provides a secure, encrypted communication channel between two end point systems using public key encryption. But SSH brute force attack is one of the most significant attacks. This kind of attack aims to login to the SSH server by continually guessing a large number of user account and password combinations. In this paper, we analyze logs of SSH brute force attacks in 2014 and propose a failed-log based detection mechanism in high performance computing service environment.

• Journal of Environmental Science International
• /
• v.24 no.11
• /
• pp.1525-1540
• /
• 2015

In order to clarify the contribution rate of PM concentration due to regional emission distribution, Brute force analysis were carried out using numerical estimated PM data from WRF-CMAQ. The emission from Kyeongki region including Seoul metropolitan is the largest contribution of PM concentration than that from other regions except for emission of trans-country and source itself. Contribution rate of self emission is also the largest at Kyeongki region and its rate reach on over 95 %. And the rate at Gangwon region also higher than any region due to synoptic wind pattern. Due to synoptic wind direction at high PM episode, pollutants at downwind area along from west to east and from north to south tends to mix intensively and its composition is also complicated. Although the uncertainty of initial concentration of PM, the contribution of regional PM concentration tend to depend on the meteorological condition including intensity of synoptic and mesoscale wind and PM emission pattern over upwind region.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.221-227
• /
• 2019

It has long been known that weapon target assignment (WTA) problem is NP-hard. Nonetheless, an exact solution can be found using Brute-Force or branch-and bound method which utilize approximation. Many heuristic algorithms, genetic algorithm particle swarm optimization, etc., have been proposed which provide near-optimal solutions in polynomial time. This paper suggests polynomial time algorithm that can be obtain the optimal solution of WTA problem for the number of total weapons k, the number of weapon types m, and the number of targets n. This algorithm performs k times for O(mn) so the algorithm complexity is O(kmn). The proposed algorithm can be minimize the number of trials than brute-force method and can be obtain the optimal solution.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.41-51
• /
• 2015

In order to hide their identities, intruders on the Internet often attack targets indirectly by staging their attacks through intermediate hosts known as stepping stones. In this paper, we propose a brute-force technique to detect the stepping stone behavior on a Linux server where some shell processes remotely logged into using interactive services are trying to connect other hosts using the same interactive services such as Telnet, Secure Shell, and rlogin. The proposed scheme can provide an absolute solution even for the encrypted connections using SSH because it traces the system calls of all processes concerned with the interactive service daemon and their child processes. We also implement the proposed technique on a CentOS 6.5 x86_64 environment by the ptrace system call and a simple shell script using strace utility. Finally the experimental results show that the proposed scheme works perfectly under test scenarios.

• Journal of the Korea Convergence Society
• /
• v.10 no.3
• /
• pp.31-37
• /
• 2019

In this paper, we propose an approach to get the requirement of drone acquisition for the efficient dronebot combat system using brute force algorithm. We define parameters, such as width, depth, and important surveillance area for the surveillance mission in the Army battalion and company units based on real military operation environment and brute force algorithm with 4 steps including first, next, valid, output is applied to get the requirement of drone acquisition and each drone's path planning using computer simulation. As a result, we could get the requirement of drone acquisition and each drone's path planning, the Army could utilize our proposed approach in the Army dronebot combat system. In the future research, we will study on the reliability of our proposed approach to get the requirement of drone acquisition for the efficient dronebot combat system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2020.11a
• /
• pp.328-329
• /
• 2020

처음 방문하는 도시에서 건물의 외형만을 보고 목적지를 찾는 것은 매우 어려운 일이다. 따라서 본 연구에서는 스마트폰 카메라로부터 촬영된 영상에서 특징점을 추출하고 이를 이미 데이터베이스에 저장된 영상과 매칭하는 작업을 통해 해당 건물의 이름이 무엇인지 알려주는 시스템을 개발하였다. Oriented fast and rotated brief 알고리즘을 이용하여 크기 변화, 회전 등에 강인한 특징점을 추출하였고 알고리즘과 Brute-Force Matcher와 K-Nearest Neighbor 방법을 이용하여 특징점을 매칭하였다. 제안된 시스템은 실제 스마트폰으로 촬영된 영상을 데이터베이스에 연동하여 실험한 결과 90% 이상의 정확도를 보여 주었다.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.637-642
• /
• 2017

Honey Encryption (HE) is a technique to overcome the weakness of a brute-force attack of the existing password-based encryption (PBE). By outputting a plausible plaintext even if the wrong key is entered, it provides message recovery security which an attacker can tolerate even if the attacker tries a brute-force attack against a small entropy secret key. However, application of a cipher that requires encryption padding to the HE present a bigger problem than the conventional PBE method. In this paper, we apply a typical block cipher (AES-128) and a stream cipher (A5 / 1) to verify the problem of padding through the analysis of the sentence frequency and we propose a safe operation method of the HE.

• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.876-883
• /
• 2009

In 2008, Kim-Jun proposed RFID Mutual Authentication Protocol based on One-Time Random Numbers which are strong in Eavesdropping Attack, Spoofing attack and Replay attack. However, In 2009, Yoon-Yoo proved that it was weak in Replay attack and proposed a protocol which can prevent Replay attack. But Yoon-Yoo's protocol has problems that efficiency on communication and Brute-force attack. This paper shows weak points of Yoon-Yoo's protocol and proposes an RFID mutual authentication protocol with security and performance improvements.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.5
• /
• pp.73-78
• /
• 2011

The DES encryption algorithm employed in information security has a strong avalanche effect, and the processing speed to encrypt is also fast. However, due to the H/W advances, the secret key length of DES having 56bits is not enough so that it is easily exposed to brute force attack. In this paper, we present a new method to significantly increase the secret key length in the DES by integration of digital holography and DES algorithm. In addition, we evaluate the encryption performance of the proposed method by measuring the avalanche effect and verify the possibility of it.