• Title/Summary/Keyword: Finite Field

Search Result 3,422, Processing Time 0.05 seconds

Near-field Characterization on Light Emanated from Subwavelength Plasmonic Double Slit of Finite Length

  • Kim, Ki-Young;Goncharenko, Anatoliy V.;Hong, Jian-Shiung;Chen, Kuan-Ren
    • Journal of the Optical Society of Korea
    • /
    • v.15 no.2
    • /
    • pp.196-201
    • /
    • 2011
  • Near-field properties of light emanated from a subwavelength double slit of finite length in a thin metal film, which is essential for understanding fundamental physical mechanisms for near-field optical beam manipulations and various potential nanophotonic device applications, is investigated by using a three-dimensional finite-difference time-domain method. Near-field intensity distribution along the propagation direction of light after passing through the slit has been obtained from the phase relation of transverse electric and magnetic fields and the wave impedance. It is found that the near field of emerged light from the both slits is evanescent, that is consistent with conventional surface plasmon localization near the metal surface. Due to the finite of the slit, the amplitude of this evanescent field does not monotonically approach to than of the infinite slit as the slit length increases, i.e. the near-field of the longer slit along the center line can be weaker than that of the shorter one.

3X Serial GF(2m) Multiplier on Polynomial Basis Finite Field (Polynomial basis 방식의 3배속 직렬 유한체 곱셈기)

  • 문상국
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.255-258
    • /
    • 2004
  • Efficient finite field operation in the elliptic curve (EC) public key cryptography algorithm, which attracts much of latest issues in the applications in information security, is very important. Traditional serial finite multipliers root from Mastrovito's serial multiplication architecture. In this paper, we adopt the polynomial basis and propose a new finite field multiplier, inducing numerical expressions which can be applied to exhibit 3 times as much performance as the Mastrovito's. We described the proposed multiplier with HDL to verify and evaluate as a proper hardware IP. HDL-implemented serial GF (Galois field) multiplier showed 3 times as fast speed as the traditional serial multiplier's adding only Partial-sum block in the hardware.

  • PDF

Posteriori Error Estimates for Adaptive Finite Element Analysis of Electro and Magnetostatic Fields (정전자장의 적응유한요소해석을 위한 오차추정)

  • 김형석;최홍순;한송엽
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.38 no.1
    • /
    • pp.22-28
    • /
    • 1989
  • This paper describes error estimate mothod for adaptive finite element analysis of two dimensional electrostatic and magnetostatic field problems. To estimate the local errors, divergence theorem is used for electrostatic field and Ampere's circuital law for magnetostatic field. To confirm the effectiveness of the proposed error estimators, adaptive finite element computations are performed using the proposed error estimators. The rates of convergence of global errors are comparable with those of existing adaptive finite element schemes which make use of field continuity conditions between element boundaries. This algorithm of error estimate can be easily implemented because of its simplicity. Especially, when the value of charge in electrostatic field and the value of current in magnetostatic field are to be figured out, this method is considerded to be preferable to other approaches.

  • PDF

Square and Cube Root Algorithms in Finite Field and Their Applications (유한체상의 제곱근과 세제곱근을 찾는 알고리즘과 그 응용)

  • Cho, Gook Hwa;Ha, Eunhye;Koo, Namhun;Kwon, Soonhak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.12
    • /
    • pp.1031-1037
    • /
    • 2012
  • We study an algorithm that can efficiently find square roots and cube roots by modifying Tonelli-Shanks algorithm, which has an application in Number Field Sieve (NFS). The Number Field Sieve, the fastest known factoring algorithm, is a powerful tool for factoring very large integer. NFS first chooses two polynomials having common root modulo N, and it consists of the following four major steps; 1. Polynomial Selection 2. Sieving 3. Matrix 4. Square Root. The last step of NFS needs the process of square root computation in Number Field, which can be computed via square root algorithm over finite field.

A Study on the Optimum Design of the Piezoelectric Actuator Using the Finite Element Method (유한요소법을 이용한 압전 액츄에이터의 최적설계에 대한 연구)

  • 임춘기;범현규;양영수
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.680-683
    • /
    • 1997
  • In this paper, the multilayer actuator is investigated by using the finite element method. The material is taken to be piezoelectric. The capacitor and interdigital wlfloating type actuator are compared to the stress field distribution under the uniform electric field. As the length of the floating electrode in the interdigital wlfloating actuator changes, the stress field around the edge of electrode is studied.

  • PDF

EQUIVALENT CIRCUIT REPRENSENTATION OF MAGNETIC FIELDS BASED ON FINITE ELEMENT MODELLING

  • Y. Kagawa;N. Wakatsuki;Kim, A. ura
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • pp.205-208
    • /
    • 2001
  • A lumped electrical circuit is an approximate representation of the field within a curtain frequency range. The finite element modelling is a synonym of the equivalent circuit. The electric conduction field and electric potential wave field have been modelled by an admittance network and an LC low-pass filter network. Here in the present paper, the equivalent magnetic circuit representation is created for a magnetostatic field by the finite element modelling in two dimension.

  • PDF

Multiplexer-Based Finite Field Multiplier Using Redundant Basis (여분 기저를 이용한 멀티플렉서 기반의 유한체 곱셈기)

  • Kim, Kee-Won
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.6
    • /
    • pp.313-319
    • /
    • 2019
  • Finite field operations have played an important role in error correcting codes and cryptosystems. Recently, the necessity of efficient computation processing is increasing for security in cyber physics systems. Therefore, efficient implementation of finite field arithmetics is more urgently needed. These operations include addition, multiplication, division and inversion. Addition is very simple and can be implemented with XOR operation. The others are somewhat more complicated than addition. Among these operations, multiplication is the most important, since time-consuming operations, such as exponentiation, division, and computing multiplicative inverse, can be performed through iterative multiplications. In this paper, we propose a multiplexer based parallel computation algorithm that performs Montgomery multiplication over finite field using redundant basis. Then we propose an efficient multiplexer based semi-systolic multiplier over finite field using redundant basis. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the AT complexity of the proposed multiplier is improved by approximately 19% and 65% compared to the multipliers of Kim-Han and Choi-Lee, respectively. Therefore, our multiplier is suitable for VLSI implementation and can be easily applied as the basic building block for various applications.

Optimization Techniques for Finite field Operations at Algorithm Levels (알고리즘 레벨 유한체 연산에 대한 최적화 연구)

  • Moon, San-Gook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.651-654
    • /
    • 2008
  • In finite field operations based on $GF(2^m)$, additions and subtractions are easily implemented. On the other hand, multiplications and divisions require mathematical elaboration of complex equations. There are two dominant way of approaching the solutions of finite filed operations, normal basis approach and polynomial basis approach, each of which has both benefits and weakness respectively. In this study, we adopted the mathematically feasible polynomial basis approach and suggest the optimization techniques of finite field operations based of mathematical principles.

  • PDF

Dynamic analysis for delaminated composites based on finite element (다중 층간분리부가 내재된 복합재 평판의 유한요소 진동해석)

  • 오진호;조맹효;김준식
    • Proceedings of the Korean Society For Composite Materials Conference
    • /
    • 2003.04a
    • /
    • pp.143-146
    • /
    • 2003
  • A finite element based on the efficient higher order zig-zag theory with multiple delaminations Is developed to refine the predictions of frequency and mode shapes. Displacement field through the thickness are constructed by superimposing linear zig-zag field to the smooth globally cubic varying field. The layer-dependent degrees of freedom of displacement fields are expressed in terms of reference primary degrees of freedom by applying interface continuity conditions including delaminated interfaces as well as free hounding surface conditions of transverse shear stresses. Thus the proposed theory is not only accurate but also efficient. This displacement field can systematically handle the number, shape, size, and locations of delaminations. Throught the dynamic version of variational approach, the dynamic equilibrium equations and variationally consistent boundary conditions are obtained. Through the natural frequency analysis and time response analysis of composite plate with multiple delaminations, the accuracy and efficiency of the present finite element are demonstrated. The present finite element is suitable in the predictions of the dynamic response of the thick composite plate with multiple delaminations.

  • PDF