• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.669-680
• /
• 2009

By identifying the unique information of the objects using the RF, the RFID technique which will be able to manage the object is spot-lighted as the main technology in Ubiquitous era. On RFID systems, since the information of RFID may easily be unveiled in air, the secure and privacy problems always exist. In this paper, we propose mutual authentication protocol based on symmetric key. Proposed protocol has been able to minimize the tag's H/W resource by using symmetric key. And we use tag ID which is encrypted with hash function and a shared symmetric key by Challenge-Response pair of PUF(Physically Unclonable Function), thus there is no key disclosure problem in our protocol.

• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.782-794
• /
• 2013

This paper proposes the wafer position recognition algorithm using camera. First, for eliminating the image distortions caused by the illumination and the irregular camera position, the wafer image is restored as a circle through projective transformation. Next, we use edge detection algorithm to extract the wafer's edge and then apply Generalized Symmetry Transform(GST) to extract a circle. The GST evaluates symmetry between two points by combining a distance weight function, a phase weight function, and a logarithmic mapping of the points' intensities and detecting interest regions. Trough several experiments, we found out the proposed method is able to prevent the cleaning system and the wafer from damaging.

• Proceedings of the KOR-KST Conference
• /
• 2007.05a
• /
• pp.89-97
• /
• 2007

본 연구에서는 통행배정 모형이 갖는 여러 가지 가정 중 대칭적 통행비용 함수를 갖는 가정을 극복할 수 있는 방법에 대해 살펴보았다. 통행배정 문제에 있어서 대칭적 비용함수 가정이라는 것은 링크의 통행비용은 다른 링크의 교통량에 전혀 영향을 받지 않는 않으면서, 동시에 해당 링크를 통과하는 단하나의 수단에 의해서만 결정된다는 의미이다. 본 연구에서는 이러한 가정을 극복할 수 있는 비대칭 통행배정모형의 특성을 살펴보고, 그 해석 모형에 대해 고찰하였다. 이 때 대표적 비대칭 통행배정 문제인 다수단 통행배정 모형을 중심으로 문제를 정의하여 검토하였다. 대각화(Diagonalized) 알고리즘과 Column Generation에 기반한 heuristic 모형을 다수단 통행배정 모형에 적용하여 그 결과를 분석하였다. 그 과정을 통해 대각화 알고리즘은 초기해의 수단과 수렴기준 수단에 따라 서로다른 해를 갖는 복수의 평형해(Equilibria)특성을 가지고 있었다. 그에 비해 Column Generation에 기반한 heuristic 모형은 Euclidean Norm을 이용한 부분최적화를 통해 복수의 평형해(Equilibria)에 관한 문제점을 개선할 수 있었다.

• Review of KIISC
• /
• v.34 no.2
• /
• pp.49-55
• /
• 2024

고전 컴퓨터에서 풀기 어려운 난제를 효율적으로 모델링하고 해결할 수 있는 양자 컴퓨터는 현재암호들을 위협하고 있다. 특히, 공개키 암호에 해당하는 RSA와 Elliptic Curve Cryptography (ECC)는 Shor의 양자 알고리즘에 의해 해당 암호들의 안전성이 기반이 되는 난제들을 다항 시간 내에 해결하여 새로운 양자 내성 암호가 필요한 상황이다. 이에 NIST는 양자내성암호 표준화 공모전을 주최함으로써 현재까지 표준화 작업을 이어나가고 있다. 대칭키 암호의 경우, Grover의양자 검색 알고리즘에 의해 고전 컴퓨터상에서 보장하던 보안 강도가 제곱근으로 감소되게 된다. 기존, 신규 암호 알고리즘 모두 양자 컴퓨터상에서의 보안 강도를 평가해야 되는 상황이며, 이에 NIST는 양자 후 보안 강도 기준을 도입하였다. 양자 후 보안 강도는 레벨 1에서 5로 정의되며, 각 레벨에는 AES 및 SHA-2/3에 대한 양자 해킹 비용이 지정되어있다. 본 논문에서는 이러한 암호 학계 상황에 따라, 대칭키 AES 및 해시 함수 SHA-2/3에 대한 해킹, 특히 양자 회로 구현 동향에 대해 살펴보고자 한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.411-421
• /
• 2001

The generalized symmetry transform evaluates symmetry without segmentation and extracts regions of interest in an image by combining locality and reflectional symmetry The demand that the symmetry transform be local is reflected by the distance weight function. When calculating large regions-of-interest, we should select a large standard deviation of distance weight function. But such a large standard deviation makes the execution time increase in the second power of r, which is a radius of search area. In this paper we propose modified scan line based GST with selectively directional attention to improve time complexity The symmetry map of our proposed GST is found to be very similar to that of the existing GST. However the computation time of the proposed GST increases linearly with respect to r because our proposed GST evaluates symmetry between a pair of edge pixels along the scan lines. The GST computation decreases considerably when the proposed GST is peformed with selectively directional attention in case of large r. Several experiments in this paper demonstrate the time efficiency and the usefulness of our proposed GST.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.323-330
• /
• 2021

Recently, the advantages of high-speed arithmetic in quantum computers have been known, and interest in quantum circuits utilizing qubits has increased. The Grover algorithm is a quantum algorithm that can reduce n-bit security level symmetric key cryptography and hash functions to n/2-bit security level. Since the Grover algorithm work on quantum computers, the symmetric cryptographic technique and hash function to be applied must be implemented in a quantum circuit. This is the motivation for these studies, and recently, research on implementing symmetric cryptographic technique and hash functions in quantum circuits has been actively conducted. However, at present, in a situation where the number of qubits is limited, we are interested in implementing with the minimum number of qubits and aim for efficient implementation. In this paper, the domestic hash function LSH is efficiently implemented using qubits recycling and pre-computation. Also, major operations such as Mix and Final were efficiently implemented as quantum circuits using ProjectQ, a quantum programming tool provided by IBM, and the quantum resources required for this were evaluated.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.117-124
• /
• 2009

The p-convergent boundary element method has been proposed to analyze two-dimensional potential problem on the basis of high order Legendre shape functions that have different property comparing with the shape functions in conventional boundary element method. The location of nodes corresponding to high order shape function are not defined along the boundary, called by nodeless node, similar to the p-convergent finite element method. As the order of shape function increases, the collocation point method is used to solve linear simultaneous equations. The collocation patterns of p-convergent boundary element method consist of non-symmetric hierarchial or symmetric non-hierarchical. As the order of shape function increases, the number of collocation point increases. The singular integral that appears in p-convergent boundary element has been calculated by special numeric quadrature technique and semi-analytical integration technique. The L-shape domain problem including singularity in the vicinity of reentrant comer is analyzed and the numerical results show that the relative error is smaller than $10^{-2}%$ range as compared with other results in literatures. In case of same condition, the symmetric p-collocation point pattern shows high accuracy of solution.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.30-39
• /
• 2017

A digital calibration technique based on digital-domain averaging for cyclic ADC is proposed. The proposed calibration compensates for nonlinearity of ADC due to capacitance mismatch of capacitors in 1.5-bit/stage MDAC. A 1.5-bit/stage MDAC with non-matched capacitors has symmetric residue plots with respect to the ideal residue plot. This intrinsic characteristic of residue plot of MDAC is reflected as symmetric A/D transfer functions. A corrected A/D transfer function can be acquired by averaging two transfer functions with non-linearity, which are symmetric with respect to the ideal analog-digital transfer function. In order to implement the aforementioned averaging operation of analog-digital transfer functions, a 12-bit cyclic ADC of this work defines two operational modes of 1.5-bit/stage MDAC. By operating MDAC as the first operational mode, the cyclic ADC acquires 12.5-bits output code with nonlinearity. For the same sampled input analog voltage, the cyclic ADC acquires another 12.5-bits output code with nonlinearity by operating MDAC as the second operational mode. Since analog-digital transfer functions from each of operational mode of 1.5-bits/stage MDAC are symmetric with respect to the ideal analog-digital transfer function, a corrected 12-bits output code can be acquired by averaging two non-ideal 12.5-bits codes. The proposed digital calibration and 12-bit cyclic ADC are implemented by using a $0.18-{\mu}m$ CMOS process in the form of full custom. The measured SNDR(ENOB) and SFDR are 65.3dB (10.6bits) and 71.7dB, respectively. INL and DNL are measured to be -0.30/-0.33LSB and -0.63/+0.56LSB, respectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.13 no.4
• /
• pp.12-17
• /
• 1976

This paper deals with characteristics and analysis of the Universal Logic Modules as well as TULM, QULM and SULM. Studies are made on minimization in Storms of symmetric circuits and theoretical stuides are made by using the symmetric functions The symmetric circuits of the ULM are realized by employing 54/74 ICs, An oscillator circuit of 10KHz. is constructed based on the ULM. The experimental results gave a good agreement with the theoretical Minimization.

• Communications of Mathematical Education
• /
• v.18 no.1 s.18
• /
• pp.257-266
• /
• 2004

자연의 세계에서 나뭇잎, 돌기물, 구름, 해안선, 곤충의 모습 등에 내재하고 있는 아름다움은 흔히 균형성, 대칭성, 다양성 등으로부터 비롯된다. 자연 현상은 복소수를 활용하여 극좌표 표현으로 묘사되는 경우가 많다. 본 논문에서는 1989년 Temple H. Fay가 Amer. Math. Monthly 96(5)호에서 발표한 나비곡선 r= e$^{cos{\theta}}$-2cos4${\theta}$+sin$^5$($\frac{\theta}{12}$)의 기하학적 성질을 대칭 이동, 회전 이동, 수치적분, 미분, 극좌표계, 삼각함수, 지수함수 및 매개함수의 표현 등 고등학교 및 대학의 미적분학 관점에서 살펴 보고 극좌표 도형에 관한 흥미 유발과 더불어 컴퓨터 활용 방법을 제시하기로 한다. 수학전문 소프트웨어인 매스매티카를 활용하여 나비곡선의 작도 및 기하학적 성질을 분석하고자 한다.