• 대한수학회지
• /
• 제52권4호
• /
• pp.797-819
• /
• 2015

A trapdoor discrete logarithm group is a cryptographic primitive with many applications, and an algorithm that allows discrete logarithm problems to be solved faster using a pre-computed table increases the practicality of using this primitive. Currently, the distinguished point method and one extension to this algorithm are the only pre-computation aided discrete logarithm problem solving algorithms appearing in the related literature. This work investigates the possibility of adopting other pre-computation matrix structures that were originally designed for used with cryptanalytic time memory tradeoff algorithms to work as pre-computation aided discrete logarithm problem solving algorithms. We find that the classical Hellman matrix structure leads to an algorithm that has performance advantages over the two existing algorithms.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제12권4호
• /
• pp.418-425
• /
• 2012

In this paper, efficient implementation of error correction code (ECC) processing circuits based on single error correction and double error detection (SEC-DED) code with check bit pre-computation is proposed for memories. During the write operation of memory, check bit pre-computation eliminates the overall bits computation required to detect a double error, thereby reducing the complexity of the ECC processing circuits. In order to implement the ECC processing circuits using the check bit pre-computation more efficiently, the proper SEC-DED codes are proposed. The H-matrix of the proposed SEC-DED code is the same as that of the odd-weight-column code during the write operation and is designed by replacing 0's with 1's at the last row of the H-matrix of the odd-weight-column code during the read operation. When compared with a conventional implementation utilizing the odd-weight- column code, the implementation based on the proposed SEC-DED code with check bit pre-computation achieves reductions in the number of gates, latency, and power consumption of the ECC processing circuits by up to 9.3%, 18.4%, and 14.1% for 64 data bits in a word.

• 정보보호학회논문지
• /
• 제27권3호
• /
• pp.477-487
• /
• 2017

MPC(multiparty computation) 프로토콜이란 다수의 사용자가 각각 데이터를 제공하고, 이를 이용하여 협력적으로 연산을 수행하는 기법이다. 기존의 MPC 프로토콜은 사용자 사이의 상호작용에 의존했기 때문에, 연산이 끝날 때까지 모든 사용자가 온라인 상태를 유지해야 했다. 이를 개선하기 위한 연구 중 하나로서, 공모하지 않은 두 서버에 연산을 위임하는 기법이 연구되고 있다. 사용자의 참여를 완전히 배제한 최초의 기법이 Peter 등에 의해 제안되었으나, 서버 간 통신량이 매우 높다는 단점이 있다. 본 논문에서는 Peter 등의 기법에서 문제가 되었던 서버 간 통신량을 PRE(proxy re-encryption)를 이용하여 개선하였다. 제안하는 기법과 유사한 기법이 두 차례 제안되었으나, 복호화 과정에서 이산대수 문제를 해결해야 하거나, 서버와 사용자 사이의 공모공격에 취약한 등 다양한 문제점이 존재한다. 본 논문에서는 기존 기법의 문제점을 분석하고 이를 바탕으로 안전하고 효율적인 MPC 프로토콜을 제안한다. 제안하는 기법은 PRE를 이용하여 서버 간 통신량을 낮추었으며, 연산과정에서 사용자의 참여를 완전히 배제하였고, 복호화 과정에서 이산대수문제를 풀지 않고도 연산결과를 얻을 수 있다.

• 한국통신학회논문지
• /
• 제23권4호
• /
• pp.1024-1034
• /
• 1998

정보통신망에서 사용하는 공개키 암호시스템은 대부분 지수 연산을 사용한다. 하지만, 암호시스템은 안전성을 고려한 큰 수의 지수 연산을 사용하기 때문에 많은 계산 량과 준비시간을 요구한다. 이러한 문제점을 해결하기 위하여 모듈러 감소 연산에서 Montgomery, Yang, Kawamura 등이 사전계산 방법, 중간계산, 그리고 테이블을 사용하는 방법을 제안하였으며, 지수 연산에서 Coster, Brickel, Lee 등이 addition chain, window, 그리고 고정된 수를 사용하는 경우 사전 계산을 하는 방법을 제안하였다. 본 논문에서는 sparse 소수를 사용한 모듈러 감소 연산 방법을 제안하고 지수연산시 계산 량을 줄이는 방법을 제안한다. 이는 이산대수 방식의 암호시스템에서 매우 효과적으로 적용할 수 있다.

• 한국공간정보시스템학회 논문지
• /
• 제10권4호
• /
• pp.11-19
• /
• 2008

최근 모바일 기기 및 무선 통신의 발달로 인하여 다양한 위치 기반 서비스에 대한 연구가 증대되고 있으며, 이러한 위치 기반 서비스의 대표적 질의인 k-최근접 질의를 효율적으로 처리하기 위한 연구가 활발히 수행되어 왔다. 기존 연구들은 질의 처리 성능의 향상을 위해, 공간 네트워크 상의 POI와 노드 사이의 거리를 미리 계산하는 pre-computation 기법을 사용한다. 그러나 이러한 pre-computation 기법들은 검색 대상이 되는 POI의 변경을 효과적으로 처리하지 못하는 단점을 갖는다. 본 논문에서는 기존 pre-computation 기법들의 단점을 극복하고, 대용량 이동객체의 위치정보를 효율적으로 관리하기 위하여 S-GRID를 이용한 분산 그리드 기법을 제안한다. 아울러 제안하는 분산 그리드 기법을 위한 k-최근접 질의 처리 알고리즘을 제시한다. 마지막으로, S-GRID 및 분산 그리드 기법의 k-최근접 질의처리 알고리즘의 성능 평가를 통해, 제안하는 기법의 우수성을 입증한다.

• 한국CDE학회논문집
• /
• 제4권4호
• /
• pp.350-354
• /
• 1999

The problem of the computation of derivatives arises in various applications of rational Bezier curves. These applications sometimes require the computation of derivative on numerous points. Therefore, many researches have dealt with the representation for the computation of derivatives with the small computation error. This paper compares the performances of the representations for the derivative of rational Bezier curves in the performances. The performance is measured as computation requirements at the pre-processing stage and at the computation stage based on the theoretical derivation of computational bound as well as the experimental verification. Based on this measurement, this paper discusses which representation is preferable in different situations.

• 디지털산업정보학회논문지
• /
• 제10권4호
• /
• pp.143-150
• /
• 2014

A high power amplifier(HPA) has widely been used in wireless communications. In order to have a maximum power efficiency, the HPA uses a saturation domain having nonlinear characteristics, which generates nonlinear distortions to decrease the transmission efficiency. In order to solve this problem, various methods to linearize HPA have been reported until now, and the pre-distorter method is very attractive among them. In this paper, a new enhanced adaptive pre-distorter method was proposed to be applied for compensating nonlinear distortions of HPA. Through computer simulations as well as the analytical analysis, it could be shown that it is possible for both conventional adaptive pre-distorter and proposed adaptive pre-distorter, to be applied for linearizing HPA. Also, the simulations results demonstrated that the proposed adaptive pre-distorter may have faster convergence speed and better capability of compensating the nonlinear distortion than the conventional adaptive pre-distorter with nearly equal computation complexity.

• Structural Engineering and Mechanics
• /
• 제55권4호
• /
• pp.885-900
• /
• 2015

This paper introduces Romberg-Richardson's method as one of the numerical integration tools for computation of stress intensity factor in a pre-cracked specimen subjected to a complex stress field across the crack faces. Also, the computation of stress intensity factor for various stress fields using existing three methods: average stress over interval method, piecewise linear stress method, piecewise quadratic method are modified by using Richardson extrapolation method. The direct integration method is used as reference for constant and linear stress distribution across the crack faces while Gauss-Chebyshev method is used as reference for nonlinear distribution of stress across the crack faces in order to obtain the stress intensity factor. It is found that modified methods (average stress over intervals-Richardson method, piecewise linear stress-Richardson method, piecewise quadratic-Richardson method) yield more accurate results after a few numbers of iterations than those obtained using these methods in their original form. Romberg-Richardson's method is proven to be more efficient and accurate than Gauss-Chebyshev method for complex stress field.

• Journal of information and communication convergence engineering
• /
• 제7권1호
• /
• pp.19-23
• /
• 2009

In this paper, we propose a general idea about an RFID system which provides lighted weight algorithm. We discuss how RFID could be applied for this kind of system, especially, compact protocol. We evaluate a few protocols that have been suggested for use in passive RFID tagged systems. We can reduce security computation without losing security features by message integration and pre-computation in this paper. And the proposed protocol can be used in low-cost RFID systems that require a small computational load for both the back-end database and the tags.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.3166-3179
• /
• 2013

A pre-processing system for adaptive noise removal is proposed based on the principle of identifying and filtering object regions and background regions. Human perception of images depends on bright, well-focused object regions; these regions can be treated with the best filters, while simpler filters can be applied to other regions to reduce overall computational complexity. In the proposed method, bright region segmentation is performed, followed by segmentation of object and background regions. Noise in dark, background, and object regions is then removed by the median, fast bilateral, and bilateral filters, respectively. Simulations show that the proposed algorithm is much faster than and performs nearly as well as the bilateral filter (which is considered a powerful noise removal algorithm); it reduces computation time by 19.4 % while reducing PSNR by only 1.57 % relative to bilateral filtering. Thus, the proposed algorithm remarkably reduces computation while maintaining accuracy.