• The Journal of Asian Finance, Economics and Business
• /
• 제7권9호
• /
• pp.31-37
• /
• 2020

The purpose of this research study is to examine the stock market's response to terrorist attacks. The study uses data of terrorist attacks in different parts of the country (Pakistan) from June 1, 2014 to May 31, 2017. The event window procedure applies to a 16-day window in which 5 days before and 10 days after the attack. In addition, several event windows have been built to test the response of the Pakistan Stock Exchange. KSE-100 index is taken as proxy of response. The total terrorist attacks are classified into four categories: attacks on law enforcement agencies, attacks on civilians, attacks on special places and attacks on politicians, government employees and bureaucrats. The standard market model is used to estimate the abnormal return of the Pakistan Stock Exchange, which takes 252 business days each year. Furthermore, BMP test is used to check statistical significance of cumulative abnormal rate of return (CAAR). The results of this study reveal that total number of terrorist attacks and attacks on law enforcement agencies show long-term effects on Pakistan stock exchange. However, attacks on civilians, attacks on special places and attacks on politicians, government employees and bureaucrats have little effect on the Pakistan Stock Exchange.

• 융합보안논문지
• /
• 제9권2호
• /
• pp.41-48
• /
• 2009

분산서비스거부 공격을 탐지하기 위한 많은 개발과 연구가 진행되고 있다. 그 중에서 통계적 기법을 이용한 방법은 정상적인 패킷과 비정상적인 패킷을 판별해 내는데 효율적이다. 본 논문에서는 여러 가지의 통계적 기법을 혼합하여 다양한 공격을 탐지할 수 있는 방법을 제안한다. 효과를 검증하기 위하여 라우터에 DDoS 공격 패킷 필터링을 설정한 경우와 제안 기법을 적용한 리눅스 라우터를 구현하여 실험한 결과, 제안 기법이 다양한 공격을 탐지하는 것 뿐만이 아니라 정상적인 서비스까지도 대부분 유지시키는 것을 확인하였다.

• 정보처리학회논문지C
• /
• 제10C권6호
• /
• pp.705-710
• /
• 2003

최근 대부분의 정보 교류가 네트워크 환경 기반에서 이루어지고 있다. 때문에 외부의 침입으로부터 시스템을 보호해 주는 네트워크 침입 탐지 기술에 대한 연구가 매우 중요한 문제로 대두되고 있다. 하지만 시스템에 대한 침입 기술은 날로 새로워지고 더욱 정교화 되고 있어 이에 대한 대비가 절실한 실정이다. 현재 대부분의 침입 탐지 시스템은 이미 알려진 외부의 침입으로부터의 경험 데이터를 이용하여 침입 유형에 효과적으로 대처하지 못하게 된다. 따라서, 본 논문에서는 통계적 학습 이론과 우도비검정 통계량을 이용하여 새로운 침입 유형까지 탐지해 낼 수 있는 변형된 통계적 학습 모형을 제안하였다. 즉, 기존의 정상적인 네트워크 사용에서 벗어나는 형태들에 대한 모형화를 통하여 시스템에 대한 침입 탐지를 수행하였다. KDD Cup-99 Task 데이터를 이용하여 정상적인 네트워크 사용을 벗어나는 새로운 침입을 제안 모형이 효과적으로 탐지함을 확인하였다.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.396-409
• /
• 2012

With the proliferation of diverse wireless devices, there is an increasing concern about the security of location information which can be spoofed or disrupted by adversaries. This paper investigates the characterization and detection of location spoofing attacks, specifically those which are attempting to falsify (degrade) the position estimate through signal strength based attacks. Since the physical-layer approach identifies and assesses the security risk of position information based solely on using received signal strength (RSS), it is applicable to nearly any practical wireless network. In this paper, we characterize the impact of signal strength and beamforming attacks on range estimates and the resulting position estimate. It is shown that such attacks can be characterized by a scaling factor that biases the individual range estimators either uniformly or selectively. We then identify the more severe types of attacks, and develop an attack detection approach which does not rely on a priori knowledge (either statistical or environmental). The resulting approach, which exploits the dissimilar behavior of two RSS-based estimators when under attack, is shown to be effective at detecting both types of attacks with the detection rate increasing with the severity of the induced location error.

• Journal of Information Processing Systems
• /
• 제12권2호
• /
• pp.310-321
• /
• 2016

TCS_SHA-3 is a family of four cryptographic hash functions that are covered by a United States patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits. The hash functions use bijective functions in place of the standard compression functions. In this paper we describe first and second preimage attacks on the full hash functions. The second preimage attack requires negligible time and the first preimage attack requires $O(2^{36})$ time. In addition to these attacks, we also present a negligible time second preimage attack on a strengthened variant of the TCS_SHA-3. All the attacks have negligible memory requirements. To the best of our knowledge, there is no prior cryptanalysis of any member of the TCS_SHA-3 family in the literature.

• ETRI Journal
• /
• 제29권5호
• /
• pp.619-632
• /
• 2007

Side channel attacks are a very serious menace to embedded devices with cryptographic applications. To counteract such attacks many randomization techniques have been proposed. One efficient technique in elliptic curve cryptosystems randomizes addition chains with binary signed digit (BSD) representations of the secret key. However, when such countermeasures have been used alone, most of them have been broken by various simple power analysis attacks. In this paper, we consider combinations which can enhance the security of countermeasures using BSD representations by adding additional countermeasures. First, we propose several ways the improved countermeasures based on BSD representations can be attacked. In an actual statistical power analysis attack, the number of samples plays an important role. Therefore, we estimate the number of samples needed in the proposed attack.

• Journal of Information Processing Systems
• /
• 제14권6호
• /
• pp.1431-1437
• /
• 2018

Securing objects in the Internet of Things (IoT) is essential. Authentication model is one candidate to secure an object, but it is only limited to handle a specific type of attack such as Sybil attack. The authentication model cannot handle other types of attack such as trust-based attacks. This paper proposed two-phase security protection for objects in IoT. The proposed method combined authentication and statistical models. The results showed that the proposed method could handle other attacks in addition to Sybil attacks, such as bad-mouthing attack, good-mouthing attack, and ballot stuffing attack.

• International Journal of Contents
• /
• 제11권4호
• /
• pp.56-69
• /
• 2015

This paper proposes an efficient image encryption scheme based on quintuple encryption using two chaotic maps. The encryption process is realized with quintuple encryption by calling the encrypt(E) and decrypt(D) functions five times with five different keys in the form EDEEE. The decryption process is accomplished in the reverse direction by invoking the encrypt and decrypt functions in the form DDDED. The keys for the quintuple encryption/decryption processes are generated by using a Tent map. The chaotic values for the encrypt/decrypt operations are generated by using a Gumowski-Mira map. The encrypt function E is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage scrambles all the rows and columns to chaotically generated positions. This stage reduces the correlation radically among the neighboring pixels. The pixel value rotation stage circularly rotates all the pixels either left or right, and the amount of rotation is based on chaotic values. The last stage performs the diffusion four times by scanning the image in four different directions: Horizontally, Vertically, Principal diagonally and Secondary diagonally. Each of the four diffusion steps performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. This stage ensures the resistance against the differential attacks. The security and performance of the proposed method is investigated thoroughly by using key space, statistical, differential, entropy and performance analysis. The experimental results confirm that the proposed scheme is computationally fast with security intact.

• 대한수학회보
• /
• 제46권4호
• /
• pp.721-741
• /
• 2009

Consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. We first study cryptanalysis of RSA when certain amount of the Most Significant Bits (MSBs) or Least Significant Bits (LSBs) of d is known. The basic lattice based technique is similar to that of Ernst et al. in Eurocrypt 2005. However, our idea of guessing a few MSBs of the secret prime p substantially reduces the requirement of MSBs or LSBs of d for the key exposure attack. Further, we consider the RSA variant proposed by Sun and Yang in PKC 2005 and show that the partial key exposure attack works significantly on this variant.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.69-72
• /
• 2000

In this paper, a novel algorithm for digital watermarking is proposed. We use two pattern keys from BCH (15, 7) code and one randomizing key. In the embedding process, optimal watermark coefficients are determined by statistical analysis of the DCT coefficients from the standpoint of HVS. In the detection, watermark coefficients are restored by correlation matching of the possible pattern keys and minimizing the estimation errors. Attacks tested in the experiments ate image enhancement and image compression (JPEG). Performance is evaluated by BER of the logo images and SNR/PSNR of the restored images. Our method has higher performance against JPEG attacks. Analysis for the performance is included.