• Journal of the Korean Institute of Telematics and Electronics
• /
• v.15 no.5
• /
• pp.29-33
• /
• 1978

In this paper, the properties of Galois fields defined over any finite field are analysed to derive Galois switching functions and the arithmetic operation methods over any finite field are showed. The polynomial expansions over finite fields by Lagrange's interpolation method are derived and proved. The results are applied to multivalued single variable logic networks.

• Journal of the Society of Naval Architects of Korea
• /
• v.29 no.1
• /
• pp.158-172
• /
• 1992

In ships and offshore structures, there are many local structures formed of thick plates and/or having the form of double wall panels. For the vibration analysis of such a kind of structures, Mindlin plate theory which includes the effects of shear deformation and rotary inertia is usually adopted. In this paper, the vibration and dynamic sensitivity analysis of Mindlin plates having the boundary conditions elastically restrained against rotation have been accomplished using the Rayleigh-Ritz method. Polynomials having the property of the Timoshenko beam functions are introduced and used as trial functions in the spatial representation of the deflection and rotations of cross sections in two directions of the plates. The results obtained by the introduced polynomials gave nearly the same numerical results as those by the Timoshenko beam functions with the remarkable reduction of computational efforts especially in the dynamic sensitivity analysis.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1977-1985
• /
• 2009

An e-Seal is an active RFID device that was set on the door of a container. e-Seal provides both the state of the seal and the remote control of the device automatically. But it has vulnerabilities like eavesdrop and impersonate because of using RFID system. A secure e-Seal authentication protocol must use PRF for encryption/decryption of reader and e-Seal. The existing PRF uses simple hash function such as MD5 or SHA which is not available for e-Seal. It is required to use strong hash functions. The hash function is a essential technique used for data integrity, message authentication and encryption in the mechanism of information security. Therefore, in this paper, we propose more secure and effective hash function based on polynomial for e-Seal authentication protocol.

• Journal of Korea Water Resources Association
• /
• v.42 no.9
• /
• pp.681-690
• /
• 2009

In this research, design precipitation was calculated by reflecting the climatic indices and its uncertainty assessment was evaluated. Climatic indices used the sea surface temperature and moisture index which observed globally. The correlation coefficients were calculated between the annual maximum precipitation and the climatic indices. and then climatic indices which have the larger correlation coefficient were selected. Therefore, the regression relationship was established by a locally weighted polynomial regression. Next, climatic indices were generated by montecarlo simulation using kernel function. Finally, the design rainfall was calculated by the locally weighted polynomial regression using generated climatic indices. At the result, the comparison of design rainfall between the reflection of the climatic indices and the frequency analysis did not indicate a significant difference. Also, this result can be used as basic data for calculation of probability precipitation to reflect climate change.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.77-85
• /
• 2002

A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.34-40
• /
• 2024

Secret sharing is a cryptographic technique that involves dividing a secret or a piece of sensitive information into multiple shares or parts, which can significantly increase the confidentiality of a secret. There has been a lot of research on secret sharing for different contexts or situations. Tassa's conjunctive secret sharing method employs polynomial derivatives to facilitate hierarchical secret sharing. However, the use of derivatives introduces several limitations in hierarchical secret sharing. Firstly, only a single group of participants can be created at each level due to the shares being generated from a sole derivative. Secondly, the method can only reconstruct a secret through conjunction, thereby restricting the specification of arbitrary secret reconstruction conditions. Thirdly, Birkhoff interpolation is required, adding complexity compared to the more accessible Lagrange interpolation used in polynomial-based secret sharing. This paper introduces the multi-compartment secret sharing method as a generalization of the conjunctive hierarchical secret sharing. Our proposed method first encrypts a secret using external groups' shares and then generates internal shares for each group by embedding the encrypted secret value in a polynomial. While the polynomial can be reconstructed with the internal shares, the polynomial just provides the encrypted secret, requiring external shares for decryption. This approach enables the creation of multiple participant groups at a single level. It supports the implementation of arbitrary secret reconstruction conditions, as well as conjunction. Furthermore, the use of polynomials allows the application of Lagrange interpolation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.29-32
• /
• 2009

무선 방송 통신 시스템에서는 높은 전력신호를 송신하기 위하여 고전력 증폭기(HPA)를 사용한다. 그러나 고전력 증폭기는 비선형 왜곡 특성을 가지고 있으며 이는 송신 신호의 품질을 저하하는 요소로 작용한다. 비선형 왜곡특성을 극복하기 위하여 여러 가지 방법이 제안되었으며 이중 LUT를 사용하는 전치 왜곡기법과 다항식을 이용한 전치 왜곡기법이 많이 사용된다. 본 논문에서는 다항식을 이용한 전치 왜곡기에서 기존보다 작은 오차와 안정화된 역함수를 제안하고 모의실험을 통하여 기존 보다 개선된 성능을 얻을 수 있음을 보인다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.1
• /
• pp.133-140
• /
• 2018

In this paper we discover the generation principle of a sequence when the characteristic polynomial of the sequence is a power of a primitive polynomial. With the generation principle, we can rearrange a sequence. Also we get the linear complexity and the required term of the sequence efficiently.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1956-1957
• /
• 2011

본 연구는 White LED를 이용하여 주변 밝기 변화에 빠르게 적응하는 퍼지 뉴로 Dimming Control System을 설계한다. 본 논문에서는 방사형기저함수 신경회로망(Radial Basis Function Neural Network: RBFNN)을 설계하여 실제 White LED Dimming Control System에 적용시켜 모델의 근사화 및 일반화 성능을 평가한다. 제안한 모델에서의 은닉층은 방사형기저함수를 사용하여 적합도를 구현하였고, 후반부의 연결가중치는 경사하강법을 사용한다. 이때 멤버쉽 함수의 중심점은 HCM 클러스터링 (Hard C-Means Clustering)을 적용하여 결정한다. 연결가중치는 4가지 형태의 다항식을 대입하여 출력을 평가하였다. 최종 출력의 최적화를 위하여 PSO(Particle Swarm Optimization)을 이용하여 은닉층 노드수 및 다항식 형태를 결정한다. 본 논문에서 제안한 LED Dimming Control System은 Atmega8535를 사용하여 PWM 제어 방식을 사용하고, 조도계(Cds)를 이용하여 LED의 밝기에 따른 주변의 밝기를 감지하여 조명에 적응시키는 방법을 적용하였다.

• Communications of the Korean Mathematical Society
• /
• v.15 no.3
• /
• pp.435-451
• /
• 2000

섀논의 샘플링 정리는 여러 방향으로 확장 발전되어왔으나 본 논문에서는 초함수 이론으로 다룰 수 있는 방향, 즉 좀 더 큰 공간에 속하는 함수에 대한 샘플링 정리를 얻는 것이다. 먼저 샘플링이론의 기본정리인 섀논-코텔니코프 공식을 소개하고 그 자연스런 확장인 페일리-위너 공간, 번스타인 공간에서의 샘플링정리 등을 다루었고 번스타인 공간의 자연스런 확장인 유계인 받침을 갖는 초함수의 푸리에변환 즉, 실공간 위에서 다항식정도로 증가하는 전해석함수에 대한 샘플링 정리를 소개한다. 끝으로 우리의 최근 결과인 실공간 위에서 지수적으로 증가하는 전해석 함수에 대한 샘플링 정리와 그 응용, 그리고 오차추정 등을 다룬다.