• Journal of Internet Computing and Services
• /
• 제21권4호
• /
• pp.43-49
• /
• 2020

This paper proposes a lossless image compression method based on arithmetic coding using block-adaptive Context Tree Weighting. The CTW method predicts and compresses the input data bit by bit. Also, it can achieve a desirable coding distribution for tree sources with an unknown model and unknown parameters. This paper suggests the method to enhance the compression rate about image data, especially aerial and satellite images that require lossless compression. The value of aerial and satellite images is significant. Also, the size of their images is huger than common images. But, existed methods have difficulties to compress these data. For these reasons, this paper shows the experiment to prove a higher compression rate when using the CTW method with divided images than when using the same method with non-divided images. The experimental results indicate that the proposed method is more effective when compressing the divided images.

• Journal of Korea Multimedia Society
• /
• 제10권1호
• /
• pp.58-65
• /
• 2007

This dissertation proposes digital video protection algorithm lot moving image based on MPEG. Shuffling-based encryption algorithms using a fixed random shuffling table are quite simple and effective but vulnerable to the chosen plaintext attack. To overcome this problem, it is necessary to change the key used for generation of the shuffling table. However, this may pose a significant burden on the security key management system. A better approach is to generate the shuffling table based on the local feature of an image. In order to withstand the chosen plaintext attack, at first, we propose a interleaving algorithm that is adaptive to the local feature of an image. Secondly, using the multiple shuffling method which is combined interleaving with existing random shuffling method, we encrypted the DPCM processed 8*8 blocks. Experimental results showed that the proposed algorithm needs only 10% time of SEED encryption algorithm and moreover there is no overhead bit. In video sequence encryption, multiple random shuffling algorithms are used to encrypt the DC and AC coefficients of intra frame, and motion vector encryption and macroblock shuffling are used to encrypt the intra-coded macroblock in predicted frame.

• Journal of KIISE
• /
• 제44권10호
• /
• pp.1034-1044
• /
• 2017

Although traversal strategies are important for the performance of model checking, many studies have ignored the impact of traversal strategies in model checking with a block-encoded abstract reachability graph. Studies have considered traversal strategies only for an abstract reachability graph without block-encoding. Block encoding plays a crucial role in the model checking performance. This paper therefore describes Dual-traversal strategy, a simple and novel technique to control traversal strategies in a block-encoded abstract reachability graph. This method uses two traversal strategies for a model checking, one for effective block-encoding, and the other for traversal in an encoded abstract reachability graph. Dual-traversal strategy is very simple and can be implemented without overhead compared to the existing single-traversal strategy. We implemented the Dual-traversal strategy in an open source model checking tool and compare the performances of different traversal strategies. The results show that the model checking performance varies from the traversal strategies for the encoded abstract reachability graph.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제21권5호
• /
• pp.14-21
• /
• 2020

In order to provide confidential services between two communicating parties, block data encryption using a symmetric secret key is applied. A power analysis attack on a cryptosystem is a side channel-analysis method that can extract a secret key by measuring the power consumption traces of the crypto device. In this paper, we propose an attack model that can recover the secret key using a power analysis attack based on a deep learning convolutional neural network (CNN) algorithm. Considering that the CNN algorithm is suitable for image analysis, we particularly adopt the recurrence plot (RP) signal processing method, which transforms the one-dimensional power trace into two-dimensional data. As a result of executing the proposed CNN attack model on an XMEGA128 experimental board that implemented the AES-128 encryption algorithm, we recovered the secret key with 22.23% accuracy using raw power consumption traces, and obtained 97.93% accuracy using power traces on which we applied the RP processing method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2012년도 추계학술대회
• /
• pp.867-869
• /
• 2012

FRUC(Frame Rate Up Conversion) is core techniques for higher quality terminals or low channel rate. For these applications, in this paper, we propose a block-based reliability evaluation method for FRUC techniques using bi-lateral symmetrical motion estimation. First, in order to measure the reliability, by introducing cost evaluation tools such as motion vector consistency as well as temporal matching and spatial matching characteristics and then by combining these tools, we propose an efficient method which arrange the blocks according to distortion size. Through several simulations, it is shown that the proposed method is very effective in finding the high distortion blocks. Furthermore, it is expected that the proposed method can be effectively utilized in FRUC techniques and Distributed Video Coding technologies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제26권5B호
• /
• pp.659-668
• /
• 2001

본 논문에서는 스테레오 정합시에 발생하는 투영적인 왜곡을 해결하기 위해 윈도우 와핑(warping)을 이용한 새로운 스테레오 정합방법을 제안한다. 투영된 영역에의 왜곡은 고정된 윈도우를 사용해서는 변위값을 추정하기 어렵기 때문에 본 논문에서는 블록정합 시에 윈도우 와핑기법을 사용한다. 와핑이 이루어지는 지점은 이전에 구해진 변위값의 신뢰성에 근거해서 구해진다. 초기의 신뢰성과 변위값은 계층적인 정합에서 구해진다. 실험의 결과는 제안한 방법이 정합이 향상되었음을 보여준다.

• Review of KIISC
• /
• 제15권2호
• /
• pp.83-92
• /
• 2005

LFSR에 기반한 고전적인 스트림 암호는 군사적 목적으로 많이 사용되었으나 차츰 공격법의 개발과 소프트웨어적으로 성능이 우수한 블록 암호가 나타나면서 상대적으로 그 사용이 현저히 줄어들게 되었다. 교준화된 스트림 암호의 예를 찾기 힘든 것도 그 일례라 할 수 있다. 최근 USN 등의 차세대 환경이 논의되고 현실화되면서 하드웨어 구현이 용이하고 뛰어난 성능을 갖고 있는 스트림 암호가 다시 각광을 받고 있다. 1990년대 후반부터 많은 새로운 tm트림 암호가 개발되고 분석되고 있으며 여러 가지 새로운 분석 방법도 제시가 되고 있다. 본 논문에서는 이러한 새로운 스트림 암호와 이에 대한 새로운 분석 방법들을 살펴보고 현재 전 세계적으로 벌어지고 있는 스트림 암호 관련 표준화 및 연구 동향에 잔해 안아본 후 스트림 암호의 설계 요구조건을 제시한다.

• Proceedings of the KAIS Fall Conference
• /
• 한국산학기술학회 2007년도 추계학술발표논문집
• /
• pp.198-200
• /
• 2007

본 논문에서는 블록 기반으로 압축된 이미지의 전송방법에서 EREC 기법들의 패킷 손실 내성을 평가하고 패킷 손실 환경에서 현존하는 EREC의 성능을 비교한다. 이 논문에서는 기존의 EREC 기법들이 임의의 비트에 대한 에러 내성을 제공하는 것과는 대조적으로 패킷 손실 환경에서 EREC방법의 검증을 그 목적으로 한다.

• Journal of KIISE:Computer Systems and Theory
• /
• 제26권9호
• /
• pp.1083-1095
• /
• 1999

최근 처리기와 입출력 시스템의 속도 차이가 점점 커짐에 따라 버퍼 캐쉬의 효율적인 관리가 더욱 중요해지고 있다. 버퍼 캐쉬는 블록 교체 정책과 선반입 정책에 의해 관리되며, 각 정책은 버퍼 캐쉬에서 블록의 가치 즉 어떤 블록이 더 가까운 미래에 참조될 것인가를 결정해야 한다. 블록의 가치는 응용들의 블록 참조 패턴의 특성에 기반하며, 블록 참조 패턴의 특성에 대한 정확한 분석은 올바른 결정을 가능하게 하여 버퍼 캐쉬의 효율을 높일 수 있다. 본 논문은 각 응용들의 블록 참조 패턴에 대한 특성을 분석하고 이를 자동으로 발견하는 기법을 제안한다. 제안된 기법은 블록의 속성과 미래 참조 거리간의 관계를 이용해 블록 참조 패턴을 발견한다. 이 기법은 2 단계 파이프라인 방법을 이용하여 온라인으로 참조 패턴을 발견할 수 있으며, 참조 패턴의 변화가 발생하면 이를 인식할 수 있다. 본 논문에서는 8개의 실제 응용 트레이스를 이용해 블록 참조 패턴의 발견을 실험하였으며, 제안된 기법이 각 응용의 블록 참조 패턴을 정확히 발견함을 확인하였다. 그리고 발견된 참조 패턴 정보를 블록 교체 정책에 적용해 보았으며, 실험 결과 기존의 대표적인 블록 교체 정책인 LRU에 비해 최대 57%까지 디스크 입출력 횟수를 줄일 수 있었다.Abstract As the speed gap between processors and disks continues to increase, the role of the buffer cache located in main memory is becoming increasingly important. The buffer cache is managed by block replacement policies and prefetching policies and each policy should decide the value of block, that is which block will be accessed in the near future. The value of block is based on the characteristics of block reference patterns of applications, hence accurate characterization of block reference patterns may improve the performance of the buffer cache. In this paper, we study the characteristics of block reference behavior of applications and propose a scheme that automatically detects the block reference patterns. The detection is made by associating block attributes of a block with the forward distance of the block. With the periodic detection using a two-stage pipeline technique, the scheme can make on-line detection of block reference patterns and monitor the changes of block reference patterns. We measured the detection capability of the proposed scheme using 8 real workload traces and found that the scheme accurately detects the block reference patterns of applications. Also, we apply the detected block reference patterns into the block replacement policy and show that replacement policies appropriate for the detected block reference patterns decreases the number of DISK I/Os by up to 57%, compared with the traditional LRU policy.

• The Journal of Society for e-Business Studies
• /
• 제20권1호
• /
• pp.89-97
• /
• 2015

In the various application environments on the internet, we use verified cipher algorithm to protect personal information of electronic commerce or application environments. Even so, if an application method isn't proper, the information you want to keep can be intercepted. This thesis studied about result of Padding Oracle Attack, an application environment which apply CBC|CBC operational mode based on block cipher and BOZ padding method.