• Journal of Korean Society for Atmospheric Environment
• /
• v.33 no.2
• /
• pp.139-158
• /
• 2017

CMAQ (Community Multiscale Air Quality Model) simulations were carried out to estimate the potential range of contributions on surface $PM_{2.5}$ concentrations over the Seoul Metropolitan Area (SMA) with the gaseous precursors and Primary Particulate Matters(PPM) available from a recent national emissions inventory. In detail, on top of a base simulation utilizing the 2013 Clean Air Policy Supporting System (CAPSS) emission inventory, a set of Brute Force Method (BFM) simulations after reducing anthropogenic $NO_x$, $SO_2$, $NH_3$, VOCs, and PPM emissions released from area, mobile, and point sources in SMA by 50% were performed in turn. Modeling results show that zero-out contributions(ZOC) of $NH_3$ and PPM emissions from SMA are as high as $4{\sim}5{\mu}g/m^3$ over the region during the modeling period. On the contrary, ZOC of local $NO_x$ and $SO_2$ emissions to SMA $PM_{2.5}$ are less than $1{\mu}g/m^3$. Moreover, model analyses indicate that a wintertime $NO_x$ reduction at least up to 50% increases SMA $PM_{2.5}$ concentrations, probably due to increased HNO3 formation and conversion to aerosols under more abundant ozone and radical conditions after the $NO_x$ reduction. However, a nation-wide $NO_x$ reduction decreased SMA $PM_{2.5}$ concentrations even during winter, which implies that nation-wide reductions would be more effective to curtail SMA $PM_{2.5}$ concentrations than localized efforts.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1165-1172
• /
• 2016

In cloud storage environment, deduplication enables efficient use of the storage. Also, in order to save network bandwidth, cloud storage service provider has introduced client-side deduplication. Cloud storage service users want to upload encrypted data to ensure confidentiality. However, common encryption method cannot be combined with deduplication, because each user uses a different private key. Also, client-side deduplication can be vulnerable to security threats because file tag replaces the entire file. Recently, proof of ownership schemes have suggested to remedy the vulnerabilities of client-side deduplication. Nevertheless, client-side deduplication over encrypted data still causes problems in efficiency and security. In this paper, we propose a secure and practical client-side encrypted data deduplication scheme that has resilience to brute force attack and performs proof of ownership over encrypted data.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.27-40
• /
• 2015

Inferring firewall policy is to discover firewall policy by analyzing response packets as results of active probing without any prior information. However, a brute-force approach for generating probing packets is unavailable because the probing packets may be regarded as attack traffic and blocked by attack detection threshold of a firewall. In this paper, we propose a firewall policy inference method using an efficient probing algorithm which considers the number of source IP addresses, maximum probing packets per second and interval size of adjacent sweep lines as inference parameters to avoid detection. We then verify whether the generated probing packets are classified as network attack patterns by a firewall, and present the result of evaluation of the correctness by comparing original firewall policy with inferred firewall policy.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.65-73
• /
• 2012

The traditional text-based password is vulnerable guessing, dictionary attacks, keyloggers, social engineering, stole view, etc. these vulnerability effect more serious problem in a mobile environment. In this study, By using the pattern number to enter the password of an existing four-digit numeric password, User easily use to new password system. The technology on pattern based numerical password authorization proposed in this paper would intensify the security of password which holds existing 10 numbers of cases by authorizing a user and would not invade convenience of use by providing high security and making users memorize only four numbers like old method. Making users not have inconvenience and raising complexity, it would have a strength to an shoulder surfing attack of an attacker. So I study password system that represents the shape-based of number. I propose the new password system to prevent peeking attacks and Brute-force attack, and this proposal is to review the security and usability.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1049-1056
• /
• 2015

Runtime Intrusion Prevention Evaluator (RIPE), published in 2011, is a benchmark suite for evaluating mitigation techniques against 850 attack patterns using only buffer overflow. Since RIPE is built as a single process, defense and attack routines cannot help sharing process states and address space layouts when RIPE is tested. As a result, attack routines can access the memory space for defense routines without restriction. We separate RIPE into two independent processes of defense and attacks so that mitigations based on confidentiality such as address space layout randomization are properly evaluated. In addition, we add an execution mode to test robustness against brute force attacks. Finally, we extend RIPE by adding 38 attack forms to perform format string attacks and virtual table (vtable) hijacking attacks. The revised RIPE contributes to the diversification of attack patterns and precise evaluation of the effectiveness of mitigations.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.327-332
• /
• 2015

Constructing a k-nearest neighbor (k-NN) graph is a primitive operation in the field of recommender systems, information retrieval, data mining and machine learning. Although there have been many algorithms proposed for constructing a k-NN graph, either the existing approaches cannot be used for various types of similarity measures, or the performance of the approaches is decreased as the number of nodes or dimensions increases. In this paper, we present a novel algorithm for k-NN graph construction based on "balanced" canopy clustering. The experimental results show that irrespective of the number of nodes or dimensions, our algorithm is at least five times faster than the brute-force approach while retaining an accuracy of approximately 92%.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.6
• /
• pp.729-738
• /
• 2019

Recently, we aim to improve the quality of virtual reality contents based on quantitative analysis results of emotions through combination of emotional recognition field and virtual reality field. Emotions are analyzed based on the participant's vital signs. Much research has been done in terms of signal analysis, but the methodology for quantifying emotions has not been fully discussed. In this paper, we propose a normalization function design and expression method to quantify the emotion between various bio - signals. Use the Brute force algorithm to find the optimal parameters of the normalization function and improve the confidence score of the parameters found using the true and false scores defined in this paper. As a result, it is possible to automate the parameter determination of the bio-signal normalization function depending on the experience, and the emotion can be analyzed quantitatively based on this.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.5
• /
• pp.83-94
• /
• 2011

Yoking proof is a concept proposed by A. Juels in 2004. It proves that a pair of tags are scanned simultaneously by one reader. After the first yoking proof protocol is proposed by A. Juels, replay attack vulnerabilities of yoking proof are considered and many other yoking proof schemes are proposed to improve it. However, compared with the first yoking proof scheme which emphasizes protocol efficiency due to the limited performance of tags, other yoking proof protocols need more computing power and storage of the tags. We propose two security protocols that consider both the general condition and limited performance of tags. The proposed scheme can protect the tags from replay attack and Brute-force attack as well. Moreover, many pairs of tags or several tag groups can be proved at the same time by executing the protocol only once.

• Journal of Environmental Science International
• /
• v.31 no.7
• /
• pp.637-652
• /
• 2022

In this study, the contributions of emissions (foreign and domestic) and atmospheric physical and chemical processes to PM_2.5 concentrations were evaluated during a high PM_2.5 episode (March 24-26, 2018) observed on the Jeju Island in the spring of 2018. These analyses were performed using the community multi-scale air quality (CMAQ) modeling system using the brute-force method and integrated process rate (IPR) analysis, respectively. The contributions of domestic emissions from South Korea (41-45%) to PM_2.5 on the Jeju Island were lower than those (81-89%) of long-range transport (LRT) from China. The substantial contribution of LRT was also confirmed in conjunction with the air mass trajectory analysis, indicating that the frequency of airflow from China (58-62% of all trajectories) was higher than from other regions (28-32%) (e.g., South Korea). These results imply that compared to domestic emissions, emissions from China have a stronger impact than domestic emissions on the high PM_2.5 concentrations in the study area. From the IPR analysis, horizontal transport contributed substantially to PM_2.5 concentrations were dominant in most of the areas of the Jeju Island during the high PM_2.5 episode, while the aerosol process and vertical transport in the southern areas largely contributed to higher PM_2.5 concentrations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.2074-2093
• /
• 2022

RSA is known as one of the best techniques for securing secret information across an unsecured network. The private key which is one of private parameters is the aim for attackers. However, it is exceedingly impossible to derive this value without disclosing all unknown parameters. In fact, many methods to recover the private key were proposed, the performance of each algorithm is acceptable for the different cases. For example, Wiener's attack is extremely efficient when the private key is very small. On the other hand, Fermat's factoring can quickly break RSA when the difference between two large prime factors of the modulus is relatively small. In general, if all private parameters are not disclosed, attackers will be able to confirm that the private key is unquestionably inside the scope [3, n - 2], where n is the modulus. However, this scope has already been reduced by increasing the greatest lower bound to [d_il, n - 2], where d_il ≥ 3. The aim of this paper is to decrease the least upper bound to narrow the scope that the private key will remain within this boundary. After finishing the proposed method, the new scope of the private key can be allocated as [d_il, d_ir], where d_ir ≤ n - 2. In fact, if the private key is extremely close to the new greatest lower bound, it can be retrieved quickly by performing a brute force attack, in which d_ir is decreased until it is equal to the private key. The experimental results indicate that the proposed method is extremely effective when the difference between prime factors is close to each other and one of two following requirement holds: the first condition is that the multiplier of Euler totient function is very close to the public key's small value whereas the second condition is that the public key should be large whenever the multiplier is far enough.