• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.190-192
• /
• 2018

This paper describes a design of an elliptic curve cryptography (ECC) processor that supports five pseudo-random curves and five Koblitz curves over binary field defined by the NIST standard. The ECC processor adopts the Lopez-Dahab projective coordinate system so that scalar multiplication is computed with modular multiplier and XORs. A word-based Montgomery multiplier of $32-b{\times}32-b$ was designed to implement ECCs of various key lengths using fixed-size hardware. The hardware operation of the ECC processor was verified by FPGA implementation. The ECC processor synthesized using a 0.18-um CMOS cell library occupies 10,674 gate equivalents (GEs) and 9 Kbits RAM at 100 MHz, and the estimated maximum clock frequency is 154 MHz.

• Korean Journal of Cognitive Science
• /
• v.26 no.1
• /
• pp.1-26
• /
• 2015

The purpose of this study was to examine whether the phonological information or the orthographic information plays a major role in visual word recognition. To do so, we used a non-word lexical decision task(LDT) in Experiment 1 and masked priming tasks in Experiement 2 and 3. The results of Experiment 1 showed that reaction times and the error rates were affected by the orthographic characteristics of the non-word stimuli such that orthographically similar non-words condition showed prolonged reaction times and higher error rates than control condition. In Experiment 2 and Experiment 3, the participants performed masked priming lexical decision tasks in two SOA conditions(60ms, 150ms). The results of the both experiments showed that the orthographically identical first syllable priming facilitated lexical decision of the target words while both of the pseudo-homophone priming and the phonologically identical first syllable priming did not. The dual route hypothesis(Coltheart et al, 2001), assuming that orthographic information rather than phonological information is the major source for the visual word recognition processes, fits well with the results of the current study.

• Annual Conference on Human and Language Technology
• /
• 1998.10c
• /
• pp.419-424
• /
• 1998

본 논문에서는 단어들의 분포적 특성을 이용하여 자동으로 단어를 군집화(clustering) 하는 기법을 제시한다. 제안된 군집화 기법에서는 단어들 사이의 거리(distance)를 가상 공간상에 있는 두 단어의 평균점에 대한 불일치의 합(total divergence to the average)으로 측정하며 군집화 알고리즘으로는 최소 신장 트리(minimal spanning tree)를 이용한다. 본 논문에서는 이 기법에 대해 두 가지 실험을 수행한다. 첫 번째 실험은 코퍼스에서 상위 출현 빈도를 가지는 약 1,200 개의 명사들을 의미에 따라 군집화 하는 것이며 두 번째 실험은 이 논문에서 제시한 자동 군집화 방법의 성능을 객관적으로 평가하기 위한 것으로 가상 단어(pseudo word)에 대한 군집화이다. 실험 결과 이 방법은 가상 단어에 대해 약 91%의 군집화 정확도와(clustering precision)와 약 81%의 군집 순수도(cluster purity)를 나타내었다. 한편 두 번째 실험에서는 평균점에 대한 불일치의 합을 이용한 거리 측정에서 나타나는 문제점을 보완한 거리 측정 방법을 제시하였으며 이를 이용하여 가상 단어 군집화를 수행한 결과 군집화 정확도와 군집 순수도가 각각 약 96% 및 95%로 향상되었다.

• 한국어정보학회:학술대회논문집
• /
• 2017.10a
• /
• pp.116-121
• /
• 2017

cQA(Community-based Question Answering) 시스템은 온라인 커뮤니티를 통해 사용자들이 질문을 남기고 답변을 작성할 수 있도록 만들어진 시스템이다. 신규 질문이 인입되면, 기존에 축적된 cQA 저장소에서 해당 질문과 가장 유사한 질문을 검색하고, 그 질문에 대한 답변을 신규 질문에 대한 답변으로 대체할 수 있다. 하지만, 키워드 매칭을 사용하는 전통적인 검색 방식으로는 문장에 내재된 의미들을 이용할 수 없다는 한계가 있다. 이를 극복하기 위해서는 의미적으로 동일한 문장들로 학습이 되어야 하지만, 이러한 데이터를 대량으로 확보하기에는 어려움이 있다. 본 논문에서는 질문이 제목과 내용으로 분리되어 있는 대량의 cQA 셋에서, 질문 제목과 내용을 의미 벡터 공간으로 사상하고 두 벡터의 상대적 거리가 가깝게 되도록 학습함으로써 의사(pseudo) 유사 의미의 성질을 내재화 하였다. 또한, 질문 제목과 내용의 의미 벡터 표현(representation)을 위하여, semi-training word embedding과 CNN(Convolutional Neural Network)을 이용한 딥러닝 기법을 제안하였다. 유사 질문 검색 실험 결과, 제안 모델을 이용한 검색이 키워드 매칭 기반 검색보다 좋은 성능을 보였다.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.247-255
• /
• 2011

Invertible functions with a single cycle property have many cryptographic applications. The main context in which we study them in this paper is pseudo random generation and stream ciphers. In some cryptographic applications we need a generator which generates binary sequences of period long enough. A common way to increase the size of the state and extend the period of a generator is to run in parallel and combine the outputs of several generators with different period. In this paper we will characterize a secure quadratic polynomial on $\mathbb{Z}_{2^n}$, which generates a binary sequence of period long enough and without consecutive elements.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.578-582
• /
• 2009

Computer-Generated Hologram (CGH) is generally made by Fourier Transform. CGH is made by an optical reconstruction. Computer-Generated Pseudo Hologram (CGPH) is made up Complex Hadamard Transform instead of CGH which is made by the Fourier Transform. CGPH differs from CGH in point of view the possibility of optical reconstruction. There is an advantage that it cannot be optical reconstruction, in other word, physical leakage of the confidential information is impossible. In this paper, a binary image was converted in Complex Hadamard Transform, and CGPH was made. Improvement of the reconstructed image from CGPH is done by error diffusion method and iterative method. The result that the reconstructed image is improved is shown.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.667-668
• /
• 2009

IPTV 시스템에서 서비스 제공자는 제한수신시스템(CAS, Conditional Access System)을 통해 미디어 콘텐츠의 안전한 전송을 제공한다. Scramble Function의 Pseudo-random sequence 생성 초기화 단계에서 사용하는 CW(Control Word)를 허가된 사용자만 획득하게 함으로써 데이터를 보호한다. 적합한 사용자 측에서는 스마트카드를 통해 획득한 CW를 셋톱박스에 전송하고, 셋톱박스는 CW를 이용해 암호화된 데이터로부터 원본의 미디어 콘텐츠를 획득한다. 이 때, CW가 그대로 셋톱박스에게 전송되기 때문에 비인가된 사용자가 공격을 통해 CW를 획득할 수 있어서 암호화된 전송이 요구된다. 이본 논문에서는 스마트카드와 셋톱박스 사이의 암호화 통신을 위해 기존의 방법보다 경량화된 상호인증 및 키 동의 프로토콜을 제안한다.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.58-67
• /
• 2019

A design of an elliptic curve cryptography (ECC) processor that supports both pseudo-random curves and Koblitz curves over $GF(2^m)$ defined by the NIST standard is described in this paper. A finite field arithmetic circuit based on a word-based Montgomery multiplier was designed to support five key lengths using a datapath of fixed size, as well as to achieve a lightweight hardware implementation. In addition, Lopez-Dahab's coordinate system was adopted to remove the finite field division operation. The ECC processor was implemented in the FPGA verification platform and the hardware operation was verified by Elliptic Curve Diffie-Hellman (ECDH) key exchange protocol operation. The ECC processor that was synthesized with a 180-nm CMOS cell library occupied 10,674 gate equivalents (GEs) and a dual-port RAM of 9 kbits, and the maximum clock frequency was estimated at 154 MHz. The scalar multiplication operation over the 223-bit pseudo-random elliptic curve takes 1,112,221 clock cycles and has a throughput of 32.3 kbps.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1058-1065
• /
• 2014

In order to assist user's who are in the process of executing a search, a query expansion method suggests keywords that are related to an input query. Recently, several studies have suggested keywords that are identified by finding domains using a clustering method over the documents that are retrieved. However, the clustering method is not relevant when presenting various domains because the number of clusters should be fixed. This paper proposes a method that suggests keywords by finding various domains related to the input queries by using a community detection algorithm. The proposed method extracts words from the top-30 documents of those that are retrieved and builds communities according to the word graph. Then, keywords representing each community are derived, and the represented keywords are used for the query expansion method. In order to evaluate the proposed method, we compared our results to those of two baseline searches performed by the Google search engine and keyword recommendation using TF-IDF in the search results. The results of the evaluation indicate that the proposed method outperforms the baseline with respect to diversity.

• Phonetics and Speech Sciences
• /
• v.4 no.3
• /
• pp.129-136
• /
• 2012

Korean alveolar fricatives are late-developing speech sounds. Most previous research on phonemes used individual words or pseudo words to produce sounds, but word-level phonological analysis does not always reflect a child's practical articulation ability. Also, there has been limited research on articulation development looking at speech production by grammatical morphemes despite its importance in Korean language. Therefore, this research examines the articulation development and phonological patterns of the /s/ phoneme in terms of morphological types produced in children's spontaneous conversational speech. The subjects were twenty-two typically developing 3- and 4-year-old Koreans. All children showed normal levels in three screening tests: hearing, vocabulary, and articulation. Spontaneous conversational samples were recorded at the children's homes. The results are as follows. The error rates decreased with increasing age in all morphological contexts. Also, error percentages within an age group were significantly lower in lexical morphemes than in grammatical morphemes. The stopping of fricative sounds was the main error pattern in all morphological contexts and reduced as age increased. This research shows that articulation performance can differ significantly by morphological contexts. The present study provides data that can be used to identify the difficult context for articulatory evaluation and therapy of alveolar fricative sounds.