• 제목/요약/키워드: 주소 데이터

Search Result 389, Processing Time 0.022 seconds

Method for Finding Related Object File for a Computer Forensics in a Log Record of $LogFile of NTFS File System (NTFS 파일시스템의 $LogFile의 로그레코드에 연관된 컴퓨터 포렌식 대상 파일을 찾기 위한 방법)

  • Cho, Gyu-Sang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.4
    • /
    • pp.1-8
    • /
    • 2012
  • The NTFS journaling file($LogFile) is used to keep the file system clean in the event of a system crash or power failure. The operation on files leaves large amounts of information in the $LogFile. Despite the importance of a journal file as a forensic evidence repository, its structure is not well documented. The researchers used reverse engineering in order to gain a better understanding of the log record structures of address parts, and utilized the address for identifying object files to gain forensic information.

An Approach to Segmentation of Address Strings of unconstrained handwritten Hangul using Run-Length Code (Rum-Length code를 이용한 제약없이 쓰여진 한글 필기체 주소열 분할)

  • Kim, Gyeonghwan;Yoon, Jason-J
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.11
    • /
    • pp.813-821
    • /
    • 2001
  • While recognition of isolated units of writing, such as a character or a word, has been extensively studied, emphasis on the segmentation itself has been lacking. In this paper we propose an active segmentation method for handwritten Hangul address strings based on the Run-length code. A slant correction algorithm, which is considered as an important preprocessing step for the segmentation, is presented. Three fundamental candidate estimation functions are introduced to detect the clues on touching points, and the classification of touching types is attempted depending on the structural peculiarity of Hangul. Our experiments show segmentation performance of 88.2% on touching characters with minimal over-segmentation.

  • PDF

A Design of an Abnormal Traffic Control Framework in IPv6 Network (IPv6 네크워크 환경에서의 비정상 트래픽 제어 프레임워크 설계)

  • Kim, Ka-Eul;Kang, Seong-Goo;Kim, Jae-Kwang;Ko, Kwang-Sun;Kang, Young-Hyeok;Eom, Young-Ik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.1103-1106
    • /
    • 2005
  • IPv4 프로토콜의 주소 고갈 문제를 해결하기 위하여 IPv6 프로토콜이 제안되었고 한국전산원의 발표에 의하면 2010년 이후에는 IPv6 프로토콜이 광범위하게 사용될 것이라고 한다. 이러한 IPv6 프로토콜은 IPv4 프로토콜의 단점들을 해결하기 위하여 ND(Neighbor Discovery) 메커니즘, 주소자동설정, IPsec 등의 기술을 지원하며, 특히 IPv6 프로토콜은 보안 문제를 해결하기 위해서 인증, 데이터 무결성 보호를 위한 IPsec 기술을 사용한다. 이러한 IPsec 기술은 패킷 정보를 보호하기 위한 목적으로 사용되기 때문에 불특정 다수의 사용자를 대상으로 하는 네트워크에 행해지는 분산 서비스 거부 공격과 같은 비정상 대용량 트래픽에 대한 탐지 및 차단에 어려움이 있다. 현재 IPv6 프로토콜을 지원하는 네트워크 공격 대응 기술로 IPv6 네트워크용 방화벽/침입탐지 시스템이 개발되어 제품으로 판매되고 있지만, 대용량의 비정상 트래픽 대응 기술을 탐지하고 차단하기에는 한계가 있다. 본 논문에서는 IPv6 네트워크 환경에서 이러한 대용량의 비정상 트래픽을 제어할 수 있는 프레임워크를 제시한다.

  • PDF

The design of SIMIP for the continuous session between a static host and a mobile host in client-server environment (클라이언트 서버 환경에서 이동호스트와 고정호스트간 지속적인 세션을 지원하는 SIMIP 설계)

  • Gwon, Eun-Gyeong;Jo, Yong-Gu;Chae, Gi-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.3
    • /
    • pp.763-773
    • /
    • 1998
  • 본논문은 TCP/IP를 사용하는 기존의 LAN상에 이동 호스트들이 셀의 형태로 덧붙여진 환경에서 이동 호스트와 고정 호스트간의 지속적인 세션을 지원하는 개선된 IP 체계인 SIMIP을 제안하였다. 이동형 프로토콜 설계시 라우팅 최적화가 매우 중요한 항목이고 이는 이동 호스트의 위치정보 관리방법과 직접적인 관계가 있다. 기존의 아이비엠과 마쓰시다 제안은 이를 집중화하였으며 콜롬비아와 소니제안은 이를 분산화하였다. MH 위치정보를 집중화하면 트라이앵글 문제로 인해 최적의 라우팅 경로를 지원할 수 없으며 집중화된 라우터의 실패 발생시는 위험도가 매우 크다. 반면에 분산화하면 위의 문제들은 해결되지만 캡슐화되는 주소를 찾기위해 CACH 또는 AMT와 같은 복잡한 기법이 요구된다. SIMIP은 MH위치정보를 DMR에 집중화하였으나 DMR 실패 발생시는 복수의 GMR중에서 하나가 자동적으로 DMR로 대체되어 위험도를 최소화시켰고, 'DMR 경로변경'에 의해 최적의 라우팅 경로를 지원하였다는 점에서 다른 제안들과 차이가 있다. 이동에 따른 주소변경을 해결하기 위해 가상네트워크 기법을 적용하였고, 이동 호스트로의 데이터 송신시 디폴트 라우팅 개념을 이용하였고, 이동라우터간 터널링에 IPIP 캡슐화를 사용하였다. SIMIP은 다른 제안에 비해 실용성있고, 신뢰성이 강하며, 구현이 용이하므로 산업계에서 활용가치가 있으리라본다.

  • PDF

E-mail system for displaying real name of receiver (수신자 실명 표시 전자 우편 시스템 개발에 관한 연구)

  • Kim Tai-Dal;Kim Min-Su
    • Journal of Internet Computing and Services
    • /
    • v.5 no.2
    • /
    • pp.49-55
    • /
    • 2004
  • This paper studies supplementing the points at issue bye-mail system for displaying real name of the addressee about the e-mail transmission failure that could be occurred by misspelled or mistyped e-mail address using e-mail system. E-mail system for displaying real name of the addressee is the system that increase the transmission probability by displaying searched for real name of the addressee on database. This is the study with intent to minimizes the economy loss of transmission success probability, outflow of data, and the server's over-tasking from the inaccuracy transmission of e-mail system.

  • PDF

Attack Evolution of 'DNSpionage' and Countermeasures on Survey ('DNS피오나지' 공격의 진화에 따른 대응방안)

  • Hong, Sunghyuck
    • Journal of Convergence for Information Technology
    • /
    • v.9 no.9
    • /
    • pp.52-57
    • /
    • 2019
  • DNS stands for 'Domain Name System' and uses IP addresses to identify devices connected to the network on the network. IP is a protocol that registers and manages aliases such as IPs because it is difficult for general users to remember. In recent years, the abuse of such DNS is increasing abroad, and behind the scenes, called 'DNS pionage,' are developing and evolving new rules and malware. DNSpionage attack is abusing DNS system such as Increasing hacking success rate, leading to fake sites, changing or forged data. As a result it is increasing the damage cases. As the global DNS system is expanding to the extent that it is out of control. Therefore, in this research, the countermeasures of DNSpionage attack is proposed to contribute to build a secure and efficient DNS system.

A Design and Implementation of High Speed Hardware Sorter with Reverse Radix Method (역방향 레딕스 방식에 위한 고속 하드웨어 정렬기의 설계 및 구현)

  • Park, Hui-Sun;Jeon, Jong-Yeon;Kim, Hui-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.992-1001
    • /
    • 1996
  • Radix sort scans the data twice in a pass, to search bit 0s of the items being sorted and store them into the lowest address, and to search bit 1s and st ore them into the following addresses. This doubles the sorting time. In this paper, we introduce Reverse Radix Sort Algorithm, in which the data being sorted are sacnned just once and write upward from the lowest address if it is 0 and downward from the highest address if it is 1. The algorithm is simple and the hardware sorter implemented by this method shows very high sorting sped. Hardware implementation requires two separate pocket memories, register, an upward increasing address counter, a downward decreasing address counter, and comparator. The software simulation of Reverse Radix Sor Algorithm performs sorting in the speed of 54.9ms per 10 thousand of 8 bit digit data, but the hardware sorter spends 5.3ms to sort the same number of data.

  • PDF

An Architecture and Experimentation for Efficient and Reliable Name Service Systems (효율적이고 신뢰성 있는 네임 서비스 시스템의 구조 및 실험)

  • 심영철;박준철;강호석;이준원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.375-390
    • /
    • 2004
  • Domain Name System(DNS), one of the most important Internet services, handles mapping from host names to Internet addresses and vice versa, and precedes many Internet applications such as Web, e-mail, file transfer, etc. In this paper, we propose a structural design of a generic name server system providing name services for a huge domain for the purpose of improving the performance as well as the reliability of the system. We demonstrate the validity of the design by implementing and running a testbed system. Our testbed employs a couple of master name sowers for distributing the service overhead over two, rather than one, servers and for achieving high availability of the system as a whole. We suggest the use of dynamic update to add and delete records from a zone for which the name server has authority. The slave name servers located remotely then get a new, updated copy of the zone via incremental zone transfers(IXFRs). The experiments with the implemented testbed show that the proposed structure would easily manage increasing demands on the server power, and be highly available in the face of transient faults of a module in the system.

Monitoring Network Security Situation Based on Flow Visualization (플로우 시각화 기반의 네트워크 보안 상황 감시)

  • Chang, Beom-Hwan
    • Convergence Security Journal
    • /
    • v.16 no.5
    • /
    • pp.41-48
    • /
    • 2016
  • In this paper we propose a new method of security visualization, VisFlow, using traffic flows to solve the problems of existing traffic flows based visualization techniques that were a loss of end-to-end semantics of communication, reflection problem by symmetrical address coordinates space, and intuitive loss problem in mass of traffic. VisFlow, a simple and effective security visualization interface, can do a real-time analysis and monitoring the situation in the managed network with visualizing a variety of network behavior not seen in the individual traffic data that can be shaped into patterns. This is a way to increase the intuitiveness and usability by identifying the role of nodes and by visualizing the highlighted or simplified information based on their importance in 2D/3D space. In addition, it monitor the network security situation as a way to increase the informational effectively using the asymmetrical connecting line based on IP addresses between pairs of nodes. Administrator can do a real-time analysis and monitoring the situation in the managed network using VisFlow, it makes to effectively investigate the massive traffic data and is easy to intuitively understand the entire network situation.

Separated Address/Data Network Design for Bus Protocol compatible Network-on-Chip (버스 프로토콜 호환 가능한 네트워크-온-칩에서의 분리된 주소/데이터 네트워크 설계)

  • Chung, Seungh Ah;Lee, Jae Hoon;Kim, Sang Heon;Lee, Jae Sung;Han, Tae Hee
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.68-75
    • /
    • 2016
  • As the number of cores and IPs increase in multiprocessor system-on-chip (MPSoC), network-on-chip (NoC) has emerged as a promising novel interconnection architecture for its parallelism and scalability. However, minimization of the latency in NoC with legacy bus IPs must be addressed. In this paper, we focus on the latency minimization problem in NoC which accommodates legacy bus protocol based IPs considering the trade-offs between hop counts and path collisions. To resolve this problem, we propose separated address/data network for independent address and data phases of bus protocol. Compared to Mesh and irregular topologies generated by TopGen, experimental results show that average latency and execution time are reduced by 19.46% and 10.55%, respectively.