• Title/Summary/Keyword: SEED 알고리즘

Search Result 190, Processing Time 0.026 seconds

Development of SEED Algorithm-based File Security System for Windows and/or Android Devices (SEED 알고리즘 기반의 윈도우즈 안드로이드 호환 파일 보호 시스템 개발)

  • Seo, Kwang-Deok;Jung, Dong-Heon;Kim, hwan-wook;Noh, young-Joo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.1264-1267
    • /
    • 2012
  • IT기기의 발전으로 다량의 개인정보들이 생성되고 이동하고 사라진다. 이에 따라 개인정보 보호의 중요성이 커지며 기존의 단순한 파일 숨김 또는 파일 잠금 형태의 보호 시스템이 아닌 데이터를 암호화하여 보안성을 높이는 시스템이 필요하다. 우리가 개발한 시스템은 윈도우즈에서는 물론 안드로이드 기기에서도 사용할 수 있으며, 윈도우즈 PC와 안드로이드 스마트폰이 통신하며 암 복호화를 가능하게 하여 활용성을 높이려 노력하였고, PC버전의 경우 대용량데이터 암 복호화 및 파일 안전 삭제 기능을 추가 하여 구현 하여 PC의 특수성도 별도로 고려하였다.

Facial Region Segmentation using Watershed Algorithm based on Depth Information (깊이정보 기반 Watershed 알고리즘을 이용한 얼굴영역 분할)

  • Kim, Jang-Won
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.4
    • /
    • pp.225-230
    • /
    • 2011
  • In this paper, we propose the segmentation method for detecting the facial region by using watershed based on depth information and merge algorithm. The method consists of three steps: watershed segmentation, seed region detection, and merge. The input color image is segmented into the small uniform regions by watershed. The facial region can be detected by merging the uniform regions with chromaticity and edge constraints. The problem in the existing method using only chromaticity or edge can solved by the proposed method. The computer simulation is performed to evaluate the performance of the proposed method. The simulation results shows that the proposed method is superior to segmentation facial region.

CPLD Implementation of SEED Cryptographic Coprocessor (SEED 암호 보조 프로세서의 CPLD 구현)

  • Choi Byeong-Yoon;Kim Jin-Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.2
    • /
    • pp.177-185
    • /
    • 2000
  • In this paper CPLD design of cryptographic coprocessor which implements SEED algorithm is described. To satisfy trade-off between area and speed, the coprocessor has structure in which 1 round operation is divided into three subrounds and then each subround is executed using one clock. To improve clock frequency, online precomputation scheme for round key is used. To apply the coprocessor to various applications, four operating modes such as ECB, CBC, CFB, and OFB are supported. The cryptographic coprocessor is designed using Altera EPF10K100GC503-3 CPLD device and its operation is verified by encryption or decryption of text files through ISA bus interface. It consists of about 29,300 gates and performance of CPLD chip is about 44 Mbps encryption or decryption rate under 18 Mhz clock frequency and ECB mode.

  • PDF

Development of Backcalculation Algorithm of Pavement System Using Matrix Solution Technique (매트릭스 해법을 이용한 포장체 각 층의 탄성계수 추정 역산알고리즘의 개발)

  • Kim, Soo Il;Lee, Kwang Ho;Park, Byung Hyun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.14 no.3
    • /
    • pp.495-508
    • /
    • 1994
  • A backcalculation procedure to determine the layer moduli of flexible pavement structure is developed using matrix solution technique. Forward calculation computer program adopted in this backcalculation procedure is SINELA which is one of layered elastic computer programs. Data base system is used as a tool for setting initial seed moduli and depth to virtual bedrock in backcalculation procedure. The validity and applicability of the proposed backcalculation procedure are verified through various numerical model tests. From the results of comparison analysis with FPEDD1, it is found that the proposed procedure gives more efficient and accurate results.

  • PDF

Document Clustering Technique by K-means Algorithm and PCA (주성분 분석과 k 평균 알고리즘을 이용한 문서군집 방법)

  • Kim, Woosaeng;Kim, Sooyoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.625-630
    • /
    • 2014
  • The amount of information is increasing rapidly with the development of the internet and the computer. Since these enormous information is managed by the document forms, it is necessary to search and process them efficiently. The document clustering technique which clusters the related documents through the similarity between the documents help to classify, search, and process the large amount of documents automatically. This paper proposes a method to find the initial seed points through principal component analysis when the documents represented by vectors in the feature vector space are clustered by K-means algorithm in order to increase clustering performance. The experiment shows that our method has a better performance than the traditional K-means algorithm.

Criteria for Evaluating Cryptographic Algorithms, based on Statistical Testing of Randomness (AES(Advanced Encryption Standard) 평가에 대한 고찰)

  • 조용국;송정환;강성우
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.6
    • /
    • pp.67-76
    • /
    • 2001
  • In this paper, we investigate criteria for evaluating cryptographic strength based on randomness testing of the advanced encryption standard candidates, which have conducted by NIST(National Institute of Standards & Technology). It is difficult to prove that a given cryptographic algorithm meets sufficient conditions or requirements for provable security. The statistical testing of random number generators is one of methods to evaluate cryptographic strength and is based on statistical properties of random number generators. We apply randomness testing on several cryptographic algorithms that have not been tested by NIST and find criteria for evaluating cryptographic strength from the results of randomness testing. We investigate two criteria, one is the number of rejected samples and the other is the p-value from p-values of the samples.

A Design of Coordinates Techniques OTP for a Secure Transmission with Key (안전한 키 전송을 위한 좌표기법 OTP 설계)

  • Lee, Kil-Hun;Jun, Moon-Seog
    • Proceedings of the KAIS Fall Conference
    • /
    • 2012.05b
    • /
    • pp.490-493
    • /
    • 2012
  • 본 논문에서는 좌표기법을 사용한 PAD 형식의 OTP를 제안하였다. 기존에 이용되던 SEED 기반의 OTP가 아닌 사용자의 기기 정보와 조합 동기화 방식을 통해 키 재료를 생성하여 OTP의 PAD 속에 좌표를 사용한 암호화를 이루는 알고리즘을 제안했기 때문에 기존의 Password 방식의 OTP보다 보안성에 우수한 특성을 나타낸다. 또한 키 교환 과정에 신개념의 Digest 방식을 도입하여 차별화를 이뤘다.

  • PDF

Automatic center-located object segmentation algorithm (자동으로 영상 중심에 위치한 객체를 분할하는 알고리즘)

  • Kim, Kyumok;Jung, Seung-Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.10a
    • /
    • pp.735-736
    • /
    • 2016
  • 본 논문에서는 웹캠을 이용하여 사용자가 추출하고자 하는 객체를 영상으로부터 추출하는 시스템을 제안한다. 영상의 중심에 위치한 Super-pixel을 표시 (Seed) 정보로 이용하여 영상에서 중심에 위치하고 있는 객체를 추출하는 방식을 제시한다.

A MapReduce-based kNN Join Query Processing Algorithm for Analyzing Large-scale Data (대용량 데이터 분석을 위한 맵리듀스 기반 kNN join 질의처리 알고리즘)

  • Lee, HyunJo;Kim, TaeHoon;Chang, JaeWoo
    • Journal of KIISE
    • /
    • v.42 no.4
    • /
    • pp.504-511
    • /
    • 2015
  • Recently, the amount of data is rapidly increasing with the popularity of the SNS and the development of mobile technology. So, it has been actively studied for the effective data analysis schemes of the large amounts of data. One of the typical schemes is a Voronoi diagram based on kNN join algorithm (VkNN-join) using MapReduce. For two datasets R and S, VkNN-join can reduce the time of the join query processing involving big data because it selects the corresponding subset Sj for each Ri and processes the query with them. However, VkNN-join requires a high computational cost for constructing the Voronoi diagram. Moreover, the computational overhead of the VkNN-join is high because the number of the candidate cells increases as the value of the k increases. In order to solve these problems, we propose a MapReduce-based kNN-join query processing algorithm for analyzing the large amounts of data. Using the seed-based dynamic partitioning, our algorithm can reduce the overhead for constructing the index structure. Also, it can reduce the computational overhead to find the candidate partitions by selecting corresponding partitions with the average distance between two seeds. We show that our algorithm has better performance than the existing scheme in terms of the query processing time.