• Journal of the Korean Institute of Telematics and Electronics
• /
• v.11 no.4
• /
• pp.1.1-11
• /
• 1974

A general and systematic method of organizing two-dimensional flexible cellular array which is capable of reclizing arbitrary combinational switching function is developed. A set of n functions of n variables is transformed to revalued functions of one variable. This set of functions form a semigroup under the normal operation which is defined in this paper. A systematic method of generating any functions using three base functions is presented. Three basic networks which are capable of realizing three base functions are designed using only one one-dimensional array. The algorithm is presented for lealizing arbitrary combinational switching functions by organizing this basic array in two.dimensional cellular array and by appropriately setting the parameters or the edge of the array.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.84-87
• /
• 2002

최근 정보보호의 중요성이 커짐에 따라 암호이론에 대한 관심이 증가되고 있다. 이 중 Galois 체 GF(2$^{m}$ )은 대부분의 암호시스템에서 사용되며, 특히 공개키 기반 암호시스템에서 주로 사용된다. 이들 암호시스템에서는 GF(2$^{m}$ )에서 정의된 연산, 즉 덧셈, 뺄셈, 곱셈 및 곱셈 역원 연산을 기반으로 구축되므로, 이들 연산을 고속으로 계산하는 것이 중요하다. 이들 연산 중에서 곱셈 역원이 가장 time-consuming하다. Fermat의 정리를 기반으로 하고, GF(2$^{m}$ )에서 정규기저를 사용해서 곱셈 역원을 고속으로 계산하기 위해서는 곱셈 횟수를 감소시키는 것이 가장 중요하며, 이와 관련된 방법들이 많이 제안되어 왔다. 이 중 Itoh와 Tsujii가 제안한 방법[2]은 곱셈 횟수를 O(log m)까지 감소시켰다. 본 논문에서는 Itoh와 Tsujii가 제안한 방법을 이용해서, m=2$^n$인 경우에 곱셈 역원을 고속으로 계산하는 방법을 제안한다. 본 논문의 방법은 필요한 곱셈 횟수가 Itoh와 Tsujii가 제안한 방법 보다 적으며, m-1의 분해가 기존의 방법보다 간단하다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.1
• /
• pp.3-11
• /
• 2000

AAL-1에서는 (128, 124) Reed-Solomon부호를 사용한 인터리버 및 디인터리버에 의해 ATM 셀에서 발생하는 오류를 정정하고 있다. Reed-Solomon부호의 복호법 중 직접복호법은 오류위치다항식의 계산없이 오류위치와 오류치를 알 수 있으며 유한체 GF(2m)의 표현에서 정규기저를 사용하면 곱셈과 나눗셈을 단순한게 비트 이동만으로 처리할 수 있다. 직접복호법과 정규기저를 사용하여 ATM 적응계층에 적용 가능한 (128, 124) Reed-Solomon부호의 복호기를 설계하고 VHDL로 시뮬레이션 하였으며 이 복호기는 동일한 복호회로에 의해 둘 또는 하나의 심벌에 발생한 오류를 정정할 수 있다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1990.10a
• /
• pp.229-233
• /
• 1990

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.51-58
• /
• 2004

Most of pubic-key cryptosystems are built on the basis of arithmetic operations defined over the finite field GF$GF(2^m)$ .The other operations of finite fields except addition can be computed by repeated multiplications. Therefore, it is very important to implement the multiplication operation efficiently in public-key cryptosystems. We propose an efficient bit-parallel normal basis multiplier for$GF(2^m)$ fields defined by All-One Polynomials. The gate count and time complexities of our proposed multiplier are lower than or equal to those of the previously proposed multipliers of the same class. Also, since the architecture of our multiplier is regular, it is suitable for VLSI implementation.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.17 no.7 s.124
• /
• pp.638-648
• /
• 2007

A principal components analysis of the entire median HRIRs in the CIPIC HRTF database reveals that the individual HRIRs can be adequately reconstructed by a linear combination of several orthonormal basis functions. The basis functions represent the inter-individual and inter-elevation variations in median HRIRs. There exist elevation-dependent tendencies in the weights of basis functions, and the basis functions can be ordered according to the magnitude of standard deviation of the weights at each elevation. We propose a HRIR customization method via tuning of the weights of 3 dominant basis functions corresponding to the 3 largest standard deviations at each elevation. Subjective listening test results show that both front-back reversal and vertical perception can be improved with the customized HRIRs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.266-268
• /
• 2003

본 논문에서는 정규 기저 표현(normal bases representation)을 갖는 GF(2$^n$) 상에서의 병렬 멱승 연산에 있어서, 프로세서 수가 고정된 경우에 라운드 수를 개선하는 방안에 대하여 기술한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.196-202
• /
• 2013

Basal cell carcinoma (BCC) is the most common skin cancer and its incidence is increasing rapidly. In this paper, we propose a diagnosis method of basal cell carcinoma by Raman spectra of skin tissue using the NMF(non-negative matrix factorization) algorithm. After preprocessing steps, measured Raman spectra is used classification experiments. The weight and the basis can be obtained in a simple matrix operation and a column vector of the matrix decompsed by the NMF. Linear combination of bases and weights, it is possible to approximate the average of Raman spectra. The classification method is to select the class which to minimize the root mean square of the difference of the linear combination and the objective spectrum. According to the experimental results, the proposed method shows the promising results to diagnosis BCC. In addition, it confirmed that the proposed method compared with the previous research result could be effectively applied in the analysis of the Raman spectra.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.41-50
• /
• 2014

In this paper, we proposed an error detection in Gaussian normal basis multiplier over $GF(2^n)$. It is shown that by using parity prediction, error detection can be very simply constructed in hardware. The hardware overheads are only one AND gate, n+1 XOR gates, and one 1-bit register in serial multipliers, and so n AND gates, 2n-1 XOR gates in parallel multipliers. This method are detect in odd number of bit fault in C = AB.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.5
• /
• pp.979-984
• /
• 2015

In this paper, we proposed a Semi-Systolic multiplier of $GF(2^n)$ with Type II optimal Normal Basis. Comparing the complexity of the proposed multiplier with Chiou's multiplier proposed in 2012, it is saved $2n^2+44n+26$ in total transistor numbers and decrease 4 clocks in time delay. This means that, for $GF(2^{333})$ of the field recommended by NIST for ECDSA, the space complexity is 6.4% less and the time complexity of the 2% decrease. In addition, this structure has an advantage as applied to Chiou's method of concurrent error detection and correction in multiplication of $GF(2^n)$.