• 제목/요약/키워드: GSM phone security

검색결과 4건 처리시간 0.02초

중국 2G(GSM) SIM카드 복제로 인한 보안 취약성 연구 (A Study of Security Vulnerability by Cloning 2G(GSM) SIM Card in China)

  • 김완수;김식
    • 정보학연구
    • /
    • 제12권2호
    • /
    • pp.1-12
    • /
    • 2009
  • China first started its mobile phone services in 1987, and the number of users has exponentially increased so that it reached 700 millions in January 2009. Currently China's 2G(GSM) users is 650 millions. These 2G (GSM) services have an advantage of the capability to use the mobile phone with a SIM (Subscriber Identity Modul) card, one kind of smart cards, inserted into it. However, due to the security vulnerability of SIM cards being used within China's 2G (GSM) services, SIM cards cloning. Problems concerning mobile phone surveillance towards a designated person by illegal cloning ESN and IMSI have recently risen to be a massive social issue within Korea as well. These studies have experimented the possibility of SIM cards clone in various mobile communication corporations using 2G (GSM) in China, and hence discovered the security vulnerability such as the incoming outgoing, SMS service and additional services on mobile phones using clone SIM cards.

  • PDF

Reliable and Secure Voice Encryption over GSM Voice Channel

  • Lee, Hoon-Jae;Jang, Won-Tae;Kim, Tae-Yong
    • Journal of information and communication convergence engineering
    • /
    • 제8권1호
    • /
    • pp.64-70
    • /
    • 2010
  • In this paper, we study and develope a special secure Dongle to be adapted in GSM SmartPhone for secure voice communication to the serial 20-pin connector in SmartPhone. We design and implement the Dongle module hardware, firmware, and software including cipher crypto-synchronization and cipher algorithm. Also we study and emulate the SmartPhone GUI software interface including communication software module to the Dongle. Finally, we analyze the performances of crypto-synchronization in some noisy environment and also we test the secure Dongle module.

LTE 네트워크에서의 IoT 장치를 위한 향상된 보안 거래 (Enhanced Secure Transaction Protocol for IoT Devices via LTE Network)

  • AL-Alkeem, Ebrahim;Yeun, Chan Yeob;Hammadi, Yousef Al;Yeun, Hyun Ku;Byon, Young-Ji
    • 전기학회논문지
    • /
    • 제66권12호
    • /
    • pp.1921-1936
    • /
    • 2017
  • Internet of Thing (IoT) and NFC (Near Field Communication) have got a good adaptable structure that it can be easily combined with any wireless network. Since IoT/NFC can be used to communicate wirelessly with all the transactions that can be done remotely without any physical connections. In this paper, we propose an enhanced secure IoT/NFC protocol based on LTE network that enhances the original security level provided by the LTE. Our approach is new in a sense that it covers LTE in contrast to old networks like GSM and 3G, which substantially treated in the literature. Moreover, both GSM and 3G have several drawbacks when they are combined with the NFC technology, which has potential weakness in confidentiality, integrity, and authentication. Hence our new approach will resolve the security of the new LTE system. We expect that our protocol will result in new secure applications for the smart phone markets.

APPLICATIONS OF GRAPH THEORY

  • Pirzada, S.;Dharwadker, Ashay
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제11권4호
    • /
    • pp.19-38
    • /
    • 2007
  • Graph theory is becoming increasingly significant as it is applied of mathematics, science and technology. It is being actively used in fields as varied as biochemistry(genomics), electrical engineering(communication networks and coding theory), computer science(algorithms and computation) and operations research(scheduling). The powerful results in other areas of pure mathematics. Rhis paper, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's Little Theorem and the Nielson-Schreier Theorem. New applications to DNA sequencing (the SNP assembly problem) and computer network security (worm propagation) using minimum vertex covers in graphs are discussed. We also show how to apply edge coloring and matching in graphs for scheduling (the timetabling problem) and vertex coloring in graphs for map coloring and the assignment of frequencies in GSM mobile phone networks. Finally, we revisit the classical problem of finding re-entrant knight's tours on a chessboard using Hamiltonian circuits in graphs.

  • PDF