• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.5
• /
• pp.845-853
• /
• 2022

As the memory capacity of smartphone increases, the type and amount of privacy stored in the smartphone is also increasing. but recently there is an increasing possibility that various personal information such as photos and videos of smartphones may be leaked due to malicious apps by malicious attackers or other people such as repair technicians. This paper analyzed and studied the security and vulnerability of these vault apps by analyzing the cryptography algorithm and data protection function. We analyzed 5.3.7(June 13, 2022) and 3.3.2(December 30, 2020) versions of AppLock, the most downloaded information-hidding apps registered with Google Play, and found various vulnerabilities. In the case of access control, there was a vulnerability in that values for encrypting patterns entered by users were hardcoded into plain text in the source code, and encrypted pattern values were stored in xml files. In addition, in the case of the vault function, there was a vulnerability in that the files and log files for storing in the vault were not encrypted.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.447-454
• /
• 2001

Various caching and prefetching algorithms have been investigated to identify and effective method for improving the performance of I/O devices. A prefetching algorithm decreases the processing time of a system by reducing the number of disk accesses when an I/O is needed. This paper proposes an AMBA prefetching method that is an extended version of the OBA prefetching method. The AMBA prefetching method will prefetching blocks continuously as long as disk bandwidth is enough. In this method, though there were excessive data request rate, we would expect efficient prefetching. And in the AMBA prefetching method, to prevent the cache pollution, it limits the number of data blocks to be prefetched within the cache area. It can be implemented in a user-level File System based on a Linux Operating System. In particular, the proposed prefetching policy improves the system performance by about 30∼40% for large files that are accessed sequentially.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.38.1-38.1
• /
• 2021

본 발표에서는 Transformable Reflective Telescope(TRT kit)의 새로운 버전을 소개한다. TRT kit는 기본형인 뉴턴식 반사망원경에서 부경 교체를 통해 카세그레인식, 그레고리식으로 간단하게 변형 할 수 있는 광학 실험장치이다. 본 장치는 주로 망원경 교육이나 광학계 개발에 필요한 실험에 활용된다. 모듈화 설계를 통해서 여러 종류의 광학계를 쉽게 탈착하여 다양한 실험을 할 수 있다. 광기계부는 정밀하게 제작된 알루미늄 프로파일과 Isogrid구조를 채택하여 경량화 구조로 설계되었다. 이러한 경량부품들을 통해 이전 버전보다 50~70%의 중량 감소율을 달성하였다. 유한요소해석 결과 경량화된 뉴턴식 TRT kit는 이전 버전과 비교해서 자체 하중에 의한 최대 구조 변형이 0.11mm에서 0.023mm로 감소하였다. 부경 지지대 설계에는 자체 하중으로 인한 변형을 최소화하기 위해 트러스 (Truss) 구조가 도입되었다. 부경부의 자체 하중으로 인한 변형은 기존의 80㎛에서 21㎛로 감소하였다. 또한, 십자 레이저 정렬 장치가 추가되어 뉴턴식과 카세그레인식에서 공차 1.5' 이내로 광학계 정렬이 가능하다.

• Proceeding of EDISON Challenge
• /
• 2017.03a
• /
• pp.672-676
• /
• 2017

데이터 처리 및 도표화는 임상 연구 보고서에 부록을 작성할 때 시간 소모적인 작업이다. 저자는 SAS (버전 9.3) 및 R (버전 3.3.1: PK 플롯 생성 용)을 사용하여 CDISC/SDTM 표준에 부합하는 자동 부록 생성 시스템 (ARGUS)을 개발했다. 이 시스템은 하나의 주 프로그램과 세 개의 서브 프로그램으로 구성되어 있다. 일반적인 데스크탑 환경에서 제출 버튼을 누른 후 약 1 분 만에 데이터베이스 파일을 MS Word 형식의 부록 문서로 변환한다. ARGUS 시스템을 사용하여 약 8일간 팀을 구성한 부록을 작성하던 작업이 6~7 시간 내에 완료되었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.47-49
• /
• 2000

버퍼 캐쉬의 관리를 위해 많은 교체 정책들과 선반입 정책들이 연구되어져 왔다. 그러나, GNU/Linux를 포함한 많은 실제의 운영체제들은 일반적으로 Least Recently Used (LRU) 교체 정책을 사용한다. 본 논문에서는 끊임없이 적극적인 선반입이 이루어지는 가운데 버퍼관리와 선반입을 효율적으로 통합하는 SA-W2R 정책을 제안한다. 이 정책은 구현이 단순하여 실제 시스템에서 채택하기 용이하다. 이 정책은 기본적으로 버퍼 교체를 위하여 LRU 정책을 사용한다. 그러나 정책의 모듈성으로 인해 어떤 교체 정책도 이 정책에 적용될 수 있다. SA-W2R 정책에서는 선반입을 위해 오버헤드가 적어 일반적으로 많이 사용되는 LRU-One Block Lookahead(OBL) 정책을 사용한다. GNU/Linux 커널 버전 2.2.14에 구현된 SA-W2R 정책은 응용 프로그램의 실행 시간에 있어 현재 버전의 GNU/Linux 보다 최고 23%의 성능 향상을 보였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.140-148
• /
• 2009

Recent advances in communication and multimedia technologies make it possible to provide video-on-demand(VOD) services and people can access video servers over the Internet at any time using their electronic devices, such as PDA, mobile phone and digital TV. Each device has different processing capabilities, energy budgets, display sizes and network connectivities. To support such diverse devices, multiple versions of videos are needed to meet users' requests. In general cases, VOD servers cannot store all the versions of videos due to the storage limitation. When a device requests a stored version, the server can send the appropriate version immediately, but when the requested version is not stored, the server first converts some stored version to the requested version, and then sends it to the client. We call this conversion process transcoding. If transcoding occurs frequently in a VOD server, the CPU resource of the server becomes insufficient to response to clients. Thus, to admit as many requests as possible, we need to maximize the CPU availability. In this paper, we propose a new algorithm to select versions from those stored on disk using a branch and bound technique to maximize the CPU availability. We also explore the impact of these storage management policies on streaming to heterogeneous users.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.1
• /
• pp.67-75
• /
• 2022

When acquiring a product having an OS, it is very important to identify the exact kernel version of the OS. This is because the product's administrator needs to keep checking whether a new vulnerability is found in the kernel version. Also, if there is an acquisition requirement for exclusion or inclusion of a specific kernel version, the kernel identification becomes critical to the acquisition decision. In the case of the Linux kernel used in various equipment, sometimes it becomes difficult to pinpoint the device's exact version. The reason is that many manufacturers often modify the kernel to produce their own firmware optimized for their device. Furthermore, if a kernel patch is applied to the modified kernel, it will be very different from its base kernel. Therefore, it is hard to identify the Linux kernel accurately by simple methods such as a specific file existence test. In this paper, we propose a static method to classify a specific kernel version by analyzing function names stored in the symbol table. In an experiment with 100 Linux devices, we correctly identified the Linux kernel version with 99% accuracy.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.1
• /
• pp.31-42
• /
• 2017

Thumbnail, the small sized graphic file such as JPEG or GIF, serves to help the users to be recognized as a rapidly helps to make it easier recognize while browsing the large sized graphic file. Gallery application, which is installed in a later version of the 4.4.x(Kitkat) Android smartphone records the generated time of graphic file in thumbnail metadata. Thumbnail can be used to draw up the timeline of user action about user's action such as creation, modification, deletion with original graphic file analysis. Also, take advantage of the features thumbnails are stored sequentially in a single thumbcache file, even if the thumbcache is deleted, we can restore the thumbnails. This paper illustrates the feature of thumbnail created by Android OS basic gallery app and methods for utilization in digital forensics.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.65-72
• /
• 2014

Change coupling is a measure to show how strongly change-related two entities are. When two source files have been frequently changed together, they are regarded as change-coupled files and they will probably be changed together in the near future. In the previous studies, the change coupling between two files is defined with the number of common changed time, that is, common commit time of the files. However, the frequency-based technique has limitations because of 'tangled changes', which frequently happens in the development environments with version control systems. The tangled change means that several code hunks have been changed at the same time, though they have no relation with each other. In this paper, the change types of the code hunks are also used to define change coupling, in addition to the common commit time of target files. First, the frequency vector based on change types are defined with the extracted change types, and then, the similarity of change patterns are calculated using the cosine similarity measure. We conducted experiments on open source project Eclipse JDT and CDT for case studies. The result shows that the applicability of the proposed method, compared to the previous studies.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.547-549
• /
• 2004

금융과 통신의 컨버전스 영역서 탄생된 금융칩 기반 모바일뱅킹 서비스 구현 과정에서 나타난 표준화에 대한 이슈에 대해 알아보고, 그 중에서도 금융칩 표준화에 초점을 맞추었다. 금융칩 설계목적, 규격 및 파일구조 등에 대해 연구하고 현재 국내은행 중 방식 A와 방식 B를 채택한 은행간의 차이점 및 문제점, 장단점 분석 및 금융칩에 탑재하는 신용카드 방식에 대한 표준화에 대해 연구하였다.