• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.5
• /
• pp.17-24
• /
• 2009

Zhang et al. proposed a improved fast correlation attack on stream ciphers at SAC'08[8]. This attack is based on the fast correlation attack proposed at Crypto'00 and combined with FWT(fast Walsh transform). Given various attack environments, they presented complexities and success probabilities of the proposed attack algorithm. However, we found that our simulation results of the proposed attack algorithm are different from them presented in [8]. In this paper, we correct results of the proposed attack algorithm by analyzing it theoretically. And we propose a threshold of valid bias.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.3
• /
• pp.298-300
• /
• 2016

We propose a RFID distance bounding protocol that RFID tag still responds when reader sends a void challenge in order to reduce the probability of a relay attack. We analyze the success probability of relay attack depending on the full challenge ratio. Our experimental results show that our protocol is secure to relay attack.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• Convergence Security Journal
• /
• v.22 no.3
• /
• pp.25-32
• /
• 2022

Recently, the image processing industry has been activated as deep learning-based technology is introduced in the image recognition and detection field. With the development of deep learning technology, learning model vulnerabilities for adversarial attacks continue to be reported. However, studies on countermeasures against poisoning attacks that inject malicious data during learning are insufficient. The conventional countermeasure against poisoning attacks has a limitation in that it is necessary to perform a separate detection and removal operation by examining the training data each time. Therefore, in this paper, we propose a technique for reducing the attack success rate by applying modifications to the training data and inference data without a separate detection and removal process for the poison data. The One-shot kill poison attack, a clean label poison attack proposed in previous studies, was used as an attack model. The attack performance was confirmed by dividing it into a general attacker and an intelligent attacker according to the attacker's attack strategy. According to the experimental results, when the proposed defense mechanism is applied, the attack success rate can be reduced by up to 65% compared to the conventional method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.25-32
• /
• 2006

In this paper, we propose a fast correlation attack on the shrinking and self-shrinking generator. This attack is an improved algorithm or the fast correlation attack by Zhang et al. at CT-RSA 2005. For the shrinking generator, we recover the initial state of generating LFSR whose length is 61 with $2^{15.43}$ keystream bits, the computational complexity of $2^{56.3314}$ and success probability 99.9%. We also recover the initial state of generating LFSR whose length is $2^{40}$ of the self-shrinking generator with $2^{45.89}$ keystream bits, the computational complexity of $2^{112.424}$ and success probability 99.9%.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.307-314
• /
• 2010

Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)$^n$ attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)$^n$ for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)$^n$.

• Korean Journal of Applied Biomechanics
• /
• v.13 no.3
• /
• pp.241-252
• /
• 2003

The purpose of this study was to evaluate performance characteristics in the success of team attack during volleyball game. Three dimensional analysis was performed with games of business teams. Analyzed variables were followed by the movement distance of a setter when A-quick was occurred, the position during the spike, the possibility area during the attack, the right and left distance of the assistance attacker, the distance between attacker and blocker, and the distance between blockers each others. 1. It is recommended that the movement distance of the setter be decreased in order to make stable set condition. 2. In order to make one person blocking, the formation was to be consisted of the right and left formation which was associated with the progressive attack performance of the assistance attacker. 3. It is useful to widen attack area. Also it is necessary to improve the enhancement of passing the ball against the blocking of an opponent player. Finally, it is necessary to develop kinematic variables to evaluate performance characteristics of players. Further study may consider the best defense position against the attack of the opponent player.

• Journal of National Security and Military Science
• /
• s.13
• /
• pp.1-41
• /
• 2016

US 8th Army in the attack on the Western Front was a situation that was frustrated by the 13th Corps Communist army. To this time support this, goals that have been granted to the US 1st Marine Division that initiated the attack in Mupyonri direction, lack the potential to achieve was not decisive. It was a operation specific erroneous judgment that occurred because there was no one accurately grasp the battlefield of the situation the wrong UN Forces Command. Tactical victory can be to maximize the operation outcomes. However, there is no possible failure of the operation is to expand the tactical success. This is because the failure of the operation, because directly linked to the success or failure of the war. Tactical victory can be to maximize the operation outcomes. However, operation specific failure is not it possible to expand the tactical victory. Therefore tactical success of the US 1st Marine Division, can not compensate for operation specific failure of the United Nations Forces Command. However, Chinese Communist Army 9th Corps is obsessed only victory of tactics to annihilate the US 1st Marine Division, by being fixation to the Chosin whole area, it was not possible to run a operational operation. Therefore tactical success df the US 1st Marine Division, Chinese Communist Army 9th Corps is to extinguish the ability to increase the number of the 13th Corps of the Western Front, 8th Army US have contributed to have escaped the crisis. In addition, the US 10th Corps while maintaining the combat force, by an important role to withdraw through the sea, was able to complement the misjudgment of the operation.

• Fire Science and Engineering
• /
• v.23 no.2
• /
• pp.96-100
• /
• 2009

Because of dense forests and restriction of approaching for fire fighters, forest fire is easy to be a larger fire in Korea. For this result, the air attack was about 90% of extinguishing, so the application of aircrafts, especially helicopters, will be increased gradually. In the all process of forest fire attack, the method of heli-scattering water was the chief element of success of efficient forest fire attack and safe flight. Therefore, a standardized method of heli-scattering water was required. However, as it was not already standardized, a efficiency and safety of fire fighting have been decreased. In this study, we suggest a 11 patterns of methods for scatterling water based on a actual experience of air attack.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.485-494
• /
• 2012

The block cipher HIGHT is designed suitable for low-resource hardware implementation. It established as the TTA standard and ISO/IEC 18033-3 standard. In this paper, we propose a differentail fault attack against the block cipher HIGHT. In the proposed attack, we assume that an attacker is possible to inject a random byte fault in the input value of the 28-th round. This attack can recover the secret key by using the differential property between the original ciphertext and fault cipher text pairs. Using 7 and 12 error, our attack recover secret key within a few second with success probability 87% and 51%, respectively.