• 정보보호학회논문지
• /
• 제9권4호
• /
• pp.71-84
• /
• 1999

암호알고리즘 출력 때문에 대한 난수성 검정은 평문과 암호문 식별에 중요한 역할 을 하고 있다. 따라서 현재 많이 사용되고 있는 나수성 검정 방법들의 비교 및 분석은 필수적이라 할수 있 다. 또한 하 나의 검정방법을 이용하고자 할 때 평문과 암호문을 식별할수 있는 최소한의 데이터 크기 는 실시간 검 정 측면에서 많은 도움을 줄수 있을 것이다. 본 논문에서는 대표적인 몇 개의 난수성 검정 방법들에 대 하여 평문과 암호문 식별에 대한 성공률을 실험을 통하여 분석하고 실험계획법을 이용하여 주어진 표본 크기들 중에서 각 난수성 검정방법에 따른 하나의 최적의 표본크기를 제안한다.

• 한국컴퓨터정보학회논문지
• /
• 제22권8호
• /
• pp.85-91
• /
• 2017

Although various music composition programs for PCs have become commonplace, the reasons why people think it is hard to make music are the lack of experience with musical instruments, the lack of knowledge of music or composition, and the fear of learning MIDI software. In this paper, we propose an effective method to solve this problem by using plain text based method which makes it easy for the general people who do not know MIDI, have little experience of musical instruments, and cannot even read music to make their own music. As a result, many people who like music but have not been able to produce their own music may produce and distribute music, and collaborate with others to produce better quality music.

• Journal of the Korean Data and Information Science Society
• /
• 제13권2호
• /
• pp.77-85
• /
• 2002

The statistical testing methods have been widely recognized to determine the plain and cipher texts. In fact, the randomness for a sequence from an encryption algorithm is necessary to guarantee security and reliance of cipher algorithm. Thus, the statistical randomness tests are used to discover cipher text. In this paper, we would provide the critical value for an approximate entropy test by estimating the nonlinear regression equation when the number of sequence and the level of significance are given. Thus, we can discern plan and cipher text for real problem with given number of sequence and the level of significance. Also, we confirm the fitness of the estimated critical values from the rate of success for plain or cipher text.

• 정보보호학회논문지
• /
• 제1권1호
• /
• pp.79-84
• /
• 1991

본 논문에서는 유한환(finite ring)의 이론으로 부터 하나의 일향함수(one-way function)를 만든다. 이때의 일향함수는 다른 방향은 계산적으로 어려운 일향함수라는 의미로 쓴다. 주어진 환(ring)에 대한 군의 작용(group action)을 이용하여 이 함수를 만들었으며 평문(plain text)의 암호화에 응용될 수 있음을 설명한다. 이 함수에 의한 암호문을 해독하는 것은, 이론적으로 불가능하지는 않으나, 소인수 분해(factoring)의 어려움에 근거한 암호 시스템, 예를 들면 RSA 암호 시스템과 같이 계산이 어려운 문제이다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.975-978
• /
• 2002

A new conception of public-key cryptography MEPKC, Petri net based Multi-stage-Encryption Public-Key Cryptography, has been proposed in onder to guarantee stronger network communication security. Different from an ordinary public-key cryptography that opens only a single public key to the public, MEPKC opens a key-generator that can generate multiple encryption keys and uses these keys to encrypt a plain text to a cipher text stage by stage. In this paper, we propose the methods how to carry out the encryption operations. First, we describe how to design a hash function H that is used to conceal the encryption keys from attack. Then, given with a key-generator (a Petri net supposed to possess a large number of elementary T-invariants), we discuss how to randomly generate a series of encryption keys, the elementary T-invariants. Finally, we show how to use these encryption keys to encrypt a plain text to a cipher text by applying a private key cryptography, say DES.

• 대한한의학원전학회지
• /
• 제26권4호
• /
• pp.203-221
• /
• 2013

Objectives : The Major Essentials of Huangdi's Internal Classics Plain Questions (黃帝內經素問大要, MEHP) is one of the late-Chosun's literate physician Lee Gyoojoon (李圭晙, 1885-1923)'s main work, which is known to have logically proofread the Huangdi's Internal Classics Plain Questions (黃帝內經素問, HP). This study aims to examine two elements of the text: (1) the types of MEHP currently in circulation; (2) the types of publications of HP to be the MEHP's original script. Methods : In this study, basically bibliographical analyses of the form and contents was utilized about the types of MEHP and HP. However, to compare the sentences and phrases between prints, I've used 20 examples that Qian Chaochen (钱超尘) had proposed in his preceding studies. Also, regarding Lee Wonse (李元世)'s proofreading on the MEHP in 1999, I've used interviews of his students. Results : First, I've discovered that there are three versions MEHP in circulation: the woodblock printed version; Lee Wonse's handwritten version; Lee Wonse's proofreading version; and confirmed that Lee's proofreading version should be regarded as good version of MEHP. Also, I've discovered the possibility of other types of printed versions of the MEHP in existence, which is considered Lee's handwritten version's original draft. Second, I've confirmed that the original script of HP, which Lee Gyoojoon utilized for MEHP, is indeed not Gu Congde (顧從德) printed version HP, however, is the Chosun's bureau for military drill (訓練都監) printed version HP. Conclusion : Through this study, I've provided strong evidence that Lee Gyoojoon's MEHP is a unique and original research completed within the traditional realm of Korean medicine, which possesses the universality of Eastern Asian medicine represented by Huangdi's Internal Classics (黃帝內經).

• Journal of information and communication convergence engineering
• /
• 제20권4호
• /
• pp.309-316
• /
• 2022

This investigation is aimed at automatic text summarization on large-scale Vietnamese datasets. Vietnamese articles were collected from newspaper websites and plain text was extracted to build the dataset, that included 1,101,101 documents. Next, a new single-document extractive text summarization model was proposed to evaluate this dataset. In this summary model, the k-means algorithm is used to cluster the sentences of the input document using different text representations, such as BoW (bag-of-words), TF-IDF (term frequency - inverse document frequency), Word2Vec (Word-to-vector), Glove, and FastText. The summary algorithm then uses the trained k-means model to rank the candidate sentences and create a summary with the highest-ranked sentences. The empirical results of the F1-score achieved 51.91% ROUGE-1, 18.77% ROUGE-2 and 29.72% ROUGE-L, compared to 52.33% ROUGE-1, 16.17% ROUGE-2, and 33.09% ROUGE-L performed using a competitive abstractive model. The advantage of the proposed model is that it can perform well with O(n,k,p) = O(n^(k+2/p)) + O(nlog₂n) + O(np) + O(nk²) + O(k) time complexity.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2013년도 추계학술발표대회
• /
• pp.768-770
• /
• 2013

We propose a symmetric key based cryptography algorithm to encode and decode the text data with limited length using 3-dimensional magic square matrix. To encode the plain text message, input text will be translated into an index of the number stored in the key matrix. Then, Caesar's shift with pre-defined constant value is fabricated to finalize an encryption algorithm. In decode process, Caesar's shift is applied first, and the generated key matrix is used with 2D magic squares to replace the index numbers in ciphertext to restore an original text.

• 한국대기환경학회:학술대회논문집
• /
• 한국대기환경학회 2007년도 추계학술대회 논문집
• /
• pp.494-495
• /
• 2007

See Full Text

• 한국통신학회논문지
• /
• 제35권9B호
• /
• pp.1342-1349
• /
• 2010

군용 환경에서 동적으로 변화하는 PT (Plain Text) 네트워크들이 Black (Blk) 네트워크를 통하여 서로 보안성있는 통신을 하기 위해서는 Blk 네트워크를 형성하는 완전 그물형 IPSec 터널이 필요하다. 이동성과 보안성이 요구되는 Blk 네트워크에서 IPSec 터널과 보안 방안, 즉 SPD (Security Policy Database)를 동적으로 재구성하는 것은 어려운 과제이다. 본 논문에서는 기존의 IPSec 터널 터널 모드 기술과 IPSec 비밀 키 관리 기술을 바탕으로 하여 군 네트워크에서 요구하는 이동성과 보안성 능력을 제공하기 위해서 구비해야 할 기술인 DMIDP(Dynamic Multicast-based IPSec Discovery Protocol) 기술과 관련된 핵심 기술을 체계적으로 제안한다. 또 제안된 DMIDP 기법에서 나타날 이동성 및 보안성과 관련된 성능에 영향을 미치는 주요 변수와 이들의 운영 방법을 도출하고 제안된 변수 상태에서의 DMIDP 운영 효율성을 분석한다.