• 정보보호학회논문지
• /
• 제22권5호
• /
• pp.999-1007
• /
• 2012

공개키 기반 암호화 상에서의 다중 곱셈 연산은 높은 복잡도로 인해 성능 개선을 위해서는 우선적으로 고려되어야 한다. 특히 임베디드 장비는 기존의 환경과는 달리 한정적인 계산 능력과 저장 공간으로 인해 높은 복잡도를 나타내는 공개키 기반의 암호화를 수행하기에는 부적합한 특성을 가진다. 이를 극복하기 위해 다중 곱셈 연산을 빠르게 연산하고 적은 저장공간을 요구하는 기법이 활발히 연구되고 있다. 본 논문에서는 자원 한정적인 센서 네트워크 상에서의 효율적인 공개키 기반 암호화 구현을 위한 다중 곱셈기의 최신 연구 동향을 살펴본다. 이는 앞으로의 센서 네트워크상에서의 공개키 기반 암호화 구현을 위한 참고자료로서 활용이 가능하다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권3호
• /
• pp.720-737
• /
• 2024

Private set intersection cardinality (PSI-CA) is a typical problem in the field of secure multi-party computation, which enables two parties calculate the cardinality of intersection securely without revealing any information about their sets. And it is suitable for private data protection scenarios where only the cardinality of the set intersection needs to be calculated. However, most of the currently available PSI-CA protocols only meet the security under the semi-honest model and can't resist the malicious behaviors of participants. To solve the problems above, by the application of the variant of Elgamal cryptography and Bloom filter, we propose an efficient PSI-CA protocol with high security. We also present two new operations on Bloom filter called IBF and BIBF, which could further enhance the safety of private data. Using zero-knowledge proof to ensure the safety under malicious adversary model. Moreover, in order to minimize the error in the results caused by the false positive problem, we use Garbled Bloom Filter and key-value pair packing creatively and present an improved PSI-CA protocol. Through experimental comparison with several existing representative protocols, our protocol runs with linear time complexity and more excellent characters, which is more suitable for practical application scenarios.

• Nuclear Engineering and Technology
• /
• 제55권12호
• /
• pp.4350-4356
• /
• 2023

Radiation detection systems working at high count rates suffer from the overlapping of their output electric pulses, known as pulse pile-up phenomenon, resulting in spectrum distortion and degradation of the energy resolution. Pulse tail extrapolation is a pile-up correction method which tries to restore the shifted baseline of a piled-up pulse by extrapolating the overlapped part of its preceding pulse. This needs a mathematical model which is almost always nonlinear, fitted usually by a nonlinear least squares (NLS) technique. NLS is an iterative, potentially time-consuming method. The main idea of the present study is to replace the NLS technique by an integration-based non-iterative method (NIM) for pulse tail extrapolation by an exponential model. The idea of linear extrapolation, as another non-iterative method, is also investigated. Analysis of experimental data of a NaI(Tl) radiation detector shows that the proposed non-iterative method is able to provide a corrected spectrum quite similar with the NLS method, with a dramatically reduced computation time and complexity of the algorithm. The linear extrapolation approach suffers from a poor energy resolution and throughput rate in comparison with NIM and NLS techniques, but provides the shortest computation time.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.731-734
• /
• 1998

A scalable parallel algorithm is proposed for efficient image component labeling with local operatos on a mesh connected SIMD computer. In contrast to the conventional parallel labeling algorithms, where a single pixel is assigned to each PE, the algorithm presented here is scalable and can assign m$\times$m pixel set to each PE according to the input image size. The assigned pixel set is converted to a single pixel that has representative value, and the amount of the required memory and processing time can be highly reduced. For N$\times$N image, if m$\times$m pixel set is assigned to each PE of P$\times$P mesh, where P=N/m, the time complexity due to the communication of each PE and the computation complexity are reduced to O(PlogP) bit operations and O(P) bit operations, respectively, which is 1/m of each of the conventional method. This method also diminishes the amount of memory in each PE to O(P), and can decrease the number of PE to O(P2) =Θ(N2/m2) as compared to O(N2) of conventional method. Because the proposed parallel labeling algorithm is scalable, we can adapt to the increase of image size without the hardware change of the given mesh connected SIMD computer.

• 한국음향학회지
• /
• 제13권3호
• /
• pp.33-40
• /
• 1994

부호여기된 선형예측(CELP) 음성부호화기는 4.8 kbps 이하의 낮은 전송 비율에서도 좋은 성능을 갖는다. CELP형 부호기의 단점은 많은 계산량을 필요로 한다는 것이다. 본 논문에서, 우리는 복잡성을 줄이면서 CELP 보코더의 음질을 유지하는 새로운 피치 검색법을 제안하였다. 이것은 음성 파형의 자기상관계를 간단한 전처리관계식에 의해 사전에 파악하여 필요한 구간에 대해서만 피치검색을 수행하는 방법이다. 제안한 방법은 피치검색에서 기존의 방법에 비해 약 $77\%$의 복잡성이 감소되었다.

• Journal of Communications and Networks
• /
• 제12권6호
• /
• pp.544-557
• /
• 2010

This paper addresses the problem of controlling the envelope's power peak of single carrier modulated signals, band limited by root-raised cosine (RRC) pulse shaping filters, in order to reduce power amplifier back-off for very small aperture terminals ground stations. Magnitude modulation (MM) is presented as a very efficient solution to the peak-to-average power ratio problem. This paper gives a detailed description of the MM concept and its recent evolutions. It starts by extending the look-up-table (LUT) based approach of the MM concept to M-ary constellations with M ${\leq}$ 16. The constellation and RRC symmetries are explored, allowing considerable reduction on LUT computation complexity and storage requirements. An effective multistage polyphase (MPMM) approach for the MM concept is then proposed. As opposed to traditional LUT-MM solutions, MM coefficients are computed in real-time by a low complexity multirate filter system. The back-off from high-power amplifier saturation is almost eliminated (reduction is greater than 95%) with just a 2-stage MPMM system even for very demanding roll-off cases (e.g., ${\alpha}$ = 0,1). Also, the MPMM is independent of modulation in use, allowing its easy application to constellations with M > 16.

• The Journal of the Acoustical Society of Korea
• /
• 제13권2E호
• /
• pp.51-57
• /
• 1994

부호여기된 선형예측(CELP) 음성부호화기는 4.8 kbps 이하의 낮은 전송 비율에서도 좋은 성능을 갖는다. CELP형 부호기의 단점은 많은 계산량을 필요로 한다는 것이다. 본 논문에서, 우리는 복잡성을 줄이면서 CELP 보코더의 음질을 유지하는 새로운 피치 검색법을 제안하였다. 그 기본 개념은 음성 파형의 예비피치를 찾아내어 피치검색 범위를 제한하는 것이다. CELP 보코더에 제안한 방법을 적용하므로써, 피치검색에서 기존의 방법에 비해 약87%의 복잡성이 감소되었다.

• 전자공학회논문지B
• /
• 제32B권3호
• /
• pp.77-88
• /
• 1995

It is assumed in the block matching algorithm(BMA) that all the pels in a block have a same motion vector. Then, the motion vector of a block in the BMA is matched to only one or none of the objects in the worst case if objects in a block have different motion vectors. This is apparent in the motion estimation using the fast BMA which has the effect of reducing the computation time and hardware complexity, compared to the full search BMA. Although the motion vector in the motion estimation using small block size is accurate, the increased number of bits is required to represent motion vectors. In this paper, new motion vector segmentation with less additional information and hardware complexity than the conventional method is proposed. In the proposed method, a motion vector is derived from the block for motion vector segmentation and another motion vector is extracted from four neighboring blocks to consiture a motion vector pair. For the accurate motion vector of each subblock, the motion vector is assigned to each subblock by mean squared error measure. And the overlapped motion compensation using window is also applied to reduce displaced frame difference.

• 한국음향학회지
• /
• 제15권2호
• /
• pp.90-94
• /
• 1996

부호여기된 선형예측(CELP) 음성부호화기는 4.8kbps이하의 낮은 전송 비율에서도 좋은 성능을 갖는다. CELP형 부호기의 단점은 많은 계산량을 필요로 한다는 것이다. 본 논문에서, 우리는 복잡성을 줄이면서 CELP보코더의 음질을 유지하는 새로운 피치검색법을 제안하였다. 이 방법은 CELP보코더의 포만트 필터단에서 찾은 제 1 포만트를 이용하여 예비피치를 찾고, 피치검색을 예비피치 구간에서만 수행하는 것이다. 제안한 방법을 CELP보코더에 적용하므로써, 기존의 방법에 비해 약 64%의 복잡성이 감소되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3286-3300
• /
• 2016

High Efficiency Video Coding (HEVC) Standard, as the latest coding standard, introduces satisfying compression structures with respect to its predecessor Advanced Video Coding (H.264/AVC). The new coding standard can offer improved encoding performance compared with H.264/AVC. However, it also leads to enormous computational complexity that makes it considerably difficult to be implemented in real time application. In this paper, based on machine learning, a fast partitioning method is proposed, which can search for the best splitting structures for Intra-Prediction. In view of the video texture characteristics, we choose the entropy of Gray-Scale Difference Statistics (GDS) and the minimum of Sum of Absolute Transformed Difference (SATD) as two important features, which can make a balance between the computation complexity and classification performance. According to the selected features, adaptive decision trees can be built for the Coding Units (CU) with different size by offline training. Furthermore, by this way, the partition of CUs can be resolved as a binary classification problem. Experimental results have shown that the proposed algorithm can save over 34% encoding time on average, with a negligible Bjontegaard Delta (BD)-rate increase.