• Title/Summary/Keyword: 여원

Search Result 38, Processing Time 0.042 seconds

Image Encryption using Complemented MLCA based on IBCA and 2D CAT (IBCA에 기초한 여원 MLCA와 2D CAT를 이용한 영상 암호화)

  • Nam, Tae-Hee;Kim, Seok-Tae;Cho, Sung-Jin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.34-41
    • /
    • 2009
  • In this paper we propose a new image encryption method which utilizes Complemented MLCA(Complemented Maximum Length Cellular Automata) based on IBCA(Intermediate Boundary CA) and 2D CAT(Cellular Automata Transform). The encryption method is processed in the following order. First, Complemented MLCA is used to create a PN (pseudo noise) sequence, which matches the size of the original image. And, the original image goes through a XOR operation with the created sequence to convert the image into Complemented MLCA image. Then, the gateway value is set to produce a 2D CAT basis function. The produced basis function is multiplied by the encrypted MLCA image that has been converted to process the encipherment. Lastly, the stability analysis and PSNR(Peak Signal to Noise Ratio) verifies that the proposed method holds a high encryption quality status.

Image Encryption using 90/150 NBCA structure (90/150 NBCA 구조를 이용한 영상 암호화)

  • Nam, Tae-Hee;Kim, Seok-Tae;Cho, Sung-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.152-155
    • /
    • 2009
  • In this paper, we propose the image encryption method using complemented MLCA based on 90/150 NBCA(Null Boundary Cellular Automata). The encryption method is processed in the following order. First, complemented MLCA, which is derived from linear LFSR, is used to produce a PN(pseudo noise) sequence, which matches the size of the original image. Then, the created complemented MLCA sequence goes through a XOR operation with the original image to become encrypted. Lastly, an experiment is processed to verify the effectiveness of this method.

  • PDF

Complemented Maximum-Length Cellular Automata Applied on Video Encryption (비디오 암호화를 위한 여원 최대길이 셀룰라 오토마타)

  • Li, Gao-Yong;Cho, Sung-Jin;Kim, Seok-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.13-18
    • /
    • 2017
  • With the advancement of internet technology, the importance of data protection is gaining more attention. As a possible data protection solution, we propose a novel video encryption method using complemented maximum-length cellular automata (C-MLCA). The first step for encryption is to use 90/150 CA rule to generate a transition matrix T of a C-MLCA state followed by a 2D C-MLCA basis image. Then, we divide the video into multiple frames. Once, we perform exclusive-OR operation with the split frames and the 2D basis image, the final encrypted video can be obtained. By altering values of pixel, the fundamental information in visualizing image data, the proposed method provides improved security. Moreover, we carry out some computational experiments to further evaluate our method where the results confirm its feasibility.

Image Encryption Scheme using Complemented MLCA and Special Chaos Map (여원 MLCA와 특수 혼돈 함수를 이용한 영상 암호화 기법)

  • Jeong, Hyun-Soo;Park, Kyu-Chil;Cho, Sung-Jin;Kim, Seok-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.5
    • /
    • pp.873-880
    • /
    • 2020
  • The proposed encryption algorithm strengthens its security by converting pixel-specific values and changing pixel positions. The state transition matrix created by Wolfram's rule creates a complemented CA sequence with the maximum length. Then, we convert the sequence into a 2D basis image and go through a XOR operation with the original image. The final encrypted image is created by shear stressing and rearranging. The image stability analysis verified that the proposed encryption method has high security.

An Analysis of the Written Clothing represented in Magazine, -From 1955 to 1965- (<여원>에 나타난 문자의상 분석 (I) -1955년~1965년을 충심으로-)

  • 유지헌
    • Journal of the Korean Society of Costume
    • /
    • v.50 no.7
    • /
    • pp.59-74
    • /
    • 2000
  • The purposes of this study were to analyse the written clothing described in the magazine (Yea-Won) and then to review the characteristics of advertising and trends of fashion in Korea for last 10 years of 1955-1965 with a new approach to classify the images of fashion. The results of this study were as follows : 1. The characteristics of fashion advertising during this period indicated design appeals, pragmatic appeals, and image appeals. It also represented intermediate status of modern advertising and publication. 2. The trends of fashion market segmentation could be divided into four types: Fashion which considered seasons and time-place-occasion/ Fashion considered ages, occupations, and body conditions/ Fashion focused on materials/ Fashion with enlightenment, 3. The most frequently used colors were black. navy blue, white, and gray, however, it showed varieties from late 1964. Fashion materials used in clothing were kinds of wools, cottons, synthetic and combined materials. 4. Image appeals of fashion trends could be classified as Active-Country and Romantic-Elegance images.

  • PDF

Cellular Automata with a Complemented Vector as a Non-zero State in the 0-tree of a Linear TPMACA (선형 TPMACA의 0-tree의 0이 아닌 상태를 여원벡터로 갖는 셀룰라 오토마타)

  • 조성진;김한두;최언숙
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.4
    • /
    • pp.356-362
    • /
    • 2001
  • In this paper, we show the behaviors of all states in C and the states in C', where C' is a complemented cellular automata whose the complemented vector is a nonzero state in the 0-tree of a linear TPMACA C. Also we show that if we know a path in the state-transition graph of C, then we can know the behavior of all states in C.

  • PDF

Generation of Additive Maximum Length Cellular Automata (최대길이를 갖는 가산 셀룰라 오토마타의 생성)

  • Cho, Sung-Jin;Choi, Un-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1071-1074
    • /
    • 2004
  • 최대길이를 갖는 선형유한상태기계(LFSM)가 패턴생성, 신호분석, 암호, 오류정정 부호에 응용되면서 n차 원시다항식을 특성다항식으로 갖는 선형유한상태기계에 관한 연구가 활발하게 이루어지고 있다. 본 논문은 최대길이를 갖는 다양한 셀룰라 오토마타의 효과적인 생성방법을 제안한다. 특성다항식이 n 차 원시다항식인 선형 MLCA로부터 유도된 여원 CA가 MLCA임을 밝히며 여원 MLCA의 여러 가지 성질들을 분석한다. 또한 n-셀 MLCA를 ${\phi}(2^n-1)2^{n+1}/n$개 생성할 수 있음을 보인다.

  • PDF

Generation of Maximum Length Cellular Automata (최대길이를 갖는 셀룰라 오토마타의 생성)

  • Choi Un-Sook;Cho Sung-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.25-30
    • /
    • 2004
  • Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.