• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.3
• /
• pp.643-653
• /
• 2018

Xamarin is a representative cross-platform development framework that allows developers to write mobile apps in C# for multiple mobile platforms, such as Android, iOS, or Windows Phone. Using Xamarin, mobile app developers can reuse existing C# code and share significant code across multiple platforms, reducing development time and maintenance costs. Meanwhile, malware authors can also use Xamarin to spread malicious apps on more platforms, minimizing the time and cost of malicious app creation. In order to cope with this problem, it is necessary to analyze and detect malware written with Xamarin. However, little studies have been conducted on static analysis methods of the apps written in Xamarin. In this paper, we examine the structure of Android apps written with Xamarin and propose a static analysis technique for the apps. We also demonstrate how to statically reverse-engineer apps that have been transformed using code obfuscation. Because the Android apps written with Xamarin consists of Java bytecode, C# based DLL libraries, and C/C++ based native libraries, we have studied static reverse engineering techniques for these different types of code.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.397-404
• /
• 2006

Successful software attacks require both injecting malicious code into a program's address space and altering the program's flow control to the injected code. Code section can not be changed at program's runtime, so malicious code must be injected into data section. Detoured flow control into data section is a signal of software attack. We propose a new software attack detection method which verify the target address of CALL, JMP, RET instructions, which alter program's flow control, and detect a software attack when the address is not in code section. Proposed method can detect all change of flow control related data, not only program's return address but also function pointer, buffer of longjmp() function and old base pointer, so it can detect the more attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1037-1043
• /
• 2006

In this paper, we introduce a two-dimensional modulation code for holographic data storage systems(HDSS), which is a candidate for the next generation data storage system. The two-dimensional(2D) intersymbol interference(ISI) induces higher bit error rate(BER). The balanced number of zeros(dark) and ones(light) in each page reduces inter-page interference(IPI). The code rate is 519. Although the proposed code has higher code rate than other 2D code with rate 4/9, the BER performances of two codes are similar.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2C
• /
• pp.1-9
• /
• 2005

Code is a set of words. If, for any pair of words in the code, one is not prefix of another, the code is called "Prefix(-Free) Code". The prefix coding problem is, given n, to find an optimal code with the minimum-sum of lengths of n words. As a special case of this, we present a method to find, given language L in some specific classes of regular languages, an optimal code among prefix codes in L. We also show how the structure of optimal codes varies as n grows, using trees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12C
• /
• pp.1177-1181
• /
• 2003

The modulation code with the limitation of consecutive transition length is a type of channel codes in high-density magnetic recording channel. When code sequence has two or less successive transitions, the detection performance of channel outputs can be improved. However, the code rate is reduced considerably. We present a rate 7/8 nut-length limited (RLL) code that consecutive transition length of each codeword is limited to 2 (j=2), and j is allowed to be 3 when codewords are connected. In addition, the consecutive zeros of the proposed code is limited to 7 (k=7).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.247-252
• /
• 2005

Currently, the decoder receives a 16 bit channel input and restores an 8 bit data symbol in the DVD system. Such modulation code of DVD is the EFMplus code, and it is composed of a main table and a sub table. For reducing the size of the code table, this paper divided the code table into 3 groups and we implemented the decoder using this new code table. After all, this method enables us to reduce the size of ROM as reducing the total number of code from 1376 to 750.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.970-976
• /
• 2001

In this paper, OUIG IDL CFE, provided by Sunsoft, is used to take a IDL definitions as inputs and parse those. OmniORB3 is introduced to support functionality of the ORB. Suns CFE produce AST after parsing inputs. Actually, the node of AST Is instances of classes which are derived from CFE classes. As the compiler back end visit the node of the AST using iterator class, UTL_ScopeActiveIterator, it dumps codes of output. During processing, two files are generated. Routines of generating code are invoked by BE_produce.cc and codes are produced while visiting root of AST, idl_global->root(). The dump* functions which dump codes is called according to the type of node. In this paper, Mapping C++ of IDL definition is experimented and results In the same as that of omniidl which is provided by omniORB3. The code of results behavior correctly on omniORB3. In the future, we are interested in optimizing the performance of marshalling code via IDL compiler.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.319-321
• /
• 2004

전력선 통신은 최근 정보통신 기술의 급속한 발전과 더불어 많은 데이터 전송율을 요구하게 되었다. 한편, 기존의 사용하던 직교코드는 데이터 전송의 신뢰성은 높으나 준 직교코드를 사용했을 때보다 데이터 전송율은 낮다. 따라서 높은 데이터 전송율을 충족하기 위해 준 직교코드를 적용함으로서, 고속의 전력선통신을 가능하게 하고, 채널부호화를 통해 데이터의 신뢰성을 높인다. 또한, 본 논문에서는 전력선통신에 이용가능한 직교코드와 준 직교코드의 상관특성 및 비트오율특성을 비교해 봄으로서, 줄 직교코드의 유효성을 확인하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.7
• /
• pp.648-655
• /
• 2002

This paper describes implementation of a multi-channel G.723.1 Annex A (G.723.1A) focused on code optimization using a high performance general purpose Digital Signal Processor (DSP), To implement a multi-channel G.723.1A functional complexities of the ITU-T G.723.1A fixed-point C-code are measures an analyzed. Then we sort and optimize C functions in complexity order. In parallel with optimization, we verify the bit-exactness of the optimized code using the ITU-T test vectors. Using only internal memory, the optimized code can perform full-duplex 17 channel processing. In addition, we further increase the number of available channels per DSP into 22 using fast codebook search algorithms, referred to as bit -compatible optimization.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1261-1264
• /
• 2001

오늘날 우리가 사용하는 한글은 24자로 구성되어있고, 한국어만을 적기 위한 문자체계이다. 그러나 훈민정음은 28자소로 구성되어 있으며 한국어 이외에도 세계 모든 언어와 소리를 적을 수 있는 소리기호 체계이다. 현재 한글은 인터넷이나 컴퓨터에서 사용이 어렵고, 자판 구도가 불합리하며, 남북 및 세계 표준이 아직 정해지지 않고 있으며 정열방식이 불일치하고, 내부 처리 코드가 상이한 문제점을 가지고 있다. 기존의 한글처리로는 부적합한 것들을 종합적으로 해결하기 위하여 새로운 방식을 모색 하고, 미래의 방향을 제시한 목적으로 정음부호(OPA : Ortho Phonic Alphabet)의 코드 제안에 따른 기존 KS C 5601과 KS C 5700과의 코드 변환시 문제점과 OPA 표준화를 위해 이 연구를 수행한다.