• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.71-84
• /
• 1999

The randomness test for a sequence from an encription algorithm has an important role to make differences between plain and cipher text. Thus it is necessary to investigate and analyze the currently used randomness tests. Also in real time point of views it would be helpful to know a minimum sample size which gives discernment of plain and cipher text. In this paper we analyze the rate of successes for widely used nonparametric randomness tests to discern plain and cipher text through experiments. Moreover for given sample sizes an optimal sample size for each randomness test is proposed using the design of experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.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
• /
• v.13 no.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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.1 no.1
• /
• pp.79-84
• /
• 1991

We construct one-way function based on a finite ring. One-way function in this paper means that to find the inverse of the function is hard computationally. We have used the extension of group action to construct this function and applied it to encipher the given plain text. To decipher the enciphered text generated by this function is considerd\ed a hard problem. but not impossible theoretically. However, a successful enciphering system. for example, RSA system which depends on the difficulty of factoring, need not have mathematically perfectness.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• 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.

• Journal of Korean Medical classics
• /
• v.26 no.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
• /
• v.20 no.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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• 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.

• Proceedings of the Korea Air Pollution Research Association Conference
• /
• 2007.10a
• /
• pp.494-495
• /
• 2007

See Full Text

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1342-1349
• /
• 2010

Full-mesh IPSec tunnels, which constitute a black network, are required so that the dynamically changing PT (Plain Text) networks can be reachable across the black network in military environments. In the secure and mobile black networks, dynamically re-configuring IPSec tunnels and security policy database (SPD) is very difficult to manage. In this paper, for the purpose of solving mobility and security issues in military networks, we suggest the relating main technologies in association with DMIDP (Dynamic Multicast-based IPSec Discovery Protocol) based on existing IPSec ESP (Encapsulating Security Payload) tunnels and IPSec key managements. We investigate the main parameters of the proposed DMIDP techniques and their operational schemes which have effects on mobility and analyze operational effectivemess of the DMIDP with proposed parameters.