• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.340-344
• /
• 2008

In the block cipher, DPA-resistant masking methods make an appropriation of extremely high cost for the non-linear part. Block ciphers like AES and ARIA use the inversion operation as this non-linear part. This make various countermeasures be proposed for reducing the cost of masking inversion. In this paper, we propose the efficient masking inverter by rearranging the masking inversion operation over the composite field and finding duplicated multiplications.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1365-1372
• /
• 2011

This paper proposes a cognitive contrast enhancement algorithm based on the non-linear masking to advance low cognitive contrast in dark regions of images. In order to improve brightness in dark regions of an image, we propose a new contrast enhancement algorithm based on the non-linear masking using regional adaptive parameters of an image. For performance evaluation of the proposed method, chromaticity and saturation comparison as a quantitative assessment and z-score comparison as a qualitative assessment were executed between test images and their simulated images by SSR, MSR, a conventional non-linear masking and the proposed method, respectively. As a result, the proposed method showed low chromaticity and saturation difference and improved cognitive contrast for the three methods.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.233-242
• /
• 2010

In the recent years, power attacks were widely investigated, and so various countermeasures have been proposed. In the case of block ciphers, masking methods that blind the intermediate results in the algorithm computations(encryption, decryption) are well-known. In case of SEED block cipher, it uses 32 bit arithmetic addition and S-box operations as non-linear operations. Therefore the masking type conversion operations, which require some operating time and memory, are required to satisfy the masking method of all non-linear operations. In this paper, we propose a new masked S-boxes that can minimize the number of the masking type conversion operation. Moreover we construct just one masked S-box table and propose a new formula that can compute the other masked S-box's output by using this S-box table. Therefore the memory requirements for masked S-boxes are reduced to half of the existing masking method's one.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.17-25
• /
• 2008

The differential power attack (DPA)[8] is a very powerful side-channel attack tool against various cryptosystems and the masking method[10] is known to be one of its algorithmic countermeasures. But it is non-trivial to apply the masking method to non-linear functions, especially, to arithmetic adders. This paper proposes simple and efficient masking methods applicable to arithmetic adders. For this purpose, we use the fact that every combinational logic circuit (including the adders) can be decomposed into basic logic gates (AND, OR, NAND, NOR, XOR, XNOR, NOT) and try to devise efficient masking circuits for these basic gates. The resulting circuits are then applied to the arithmetic adders to get their masking algorithm. As applications, we applied the proposed masking methods to SEED and SHA-1 in hardware.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.4
• /
• pp.21-28
• /
• 2009

In the recent years, power attacks were widely investigated, and so various countermeasures have been proposed, In the case of block ciphers, masking methods that blind the intermediate values in the algorithm computations(encryption, decryption, and key-schedule) are well-known among these countermeasures. But the cost of non-linear part is extremely high in the masking method of block cipher, and so the inversion of S-box is the most significant part in the case of AES. This fact make various countermeasures be proposed for reducing the cost of masking inversion and Zakeri's method using normal bases over the composite field is known to be most efficient algorithm among these masking method. We rearrange the masking inversion operation over the composite field and so can find duplicated multiplications. Because of these duplicated multiplications, our method can reduce about 10.5% gates in comparison with Zakeri's method.

• Journal of Biomedical Engineering Research
• /
• v.28 no.2
• /
• pp.199-204
• /
• 2007

In digital radiography, to improve the contrast of digital radiography image, the multi-scale nonlinear amplification algorithm based on unsharp masking is one of the major image enhancement algorithms. In this paper, we used the Laplacian pyramid to decompose a digital radiography(DR) image. In our simulation, the DR image was decomposed into seven layers and the coefficients of the each layer was amplified with nonlinear function. We also imported a noise containment algorithm to limit noise amplification. To enhance the contrast of image, we proposed a new adaptive non-linear gain amplification coefficients. As a result of having applied to some clinical data, a detail visibility was improved significantly without unacceptable noise boosting. Images that acquired with the proposed adaptive non-linear gain coefficients have shown superior quality to those that applied similar gain control method and expected to be accepted in the clinical applications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.2
• /
• pp.149-156
• /
• 2011

In the recent years, power analysis attacks were widely investigated, and so various countermeasures have been proposed. In the case of block ciphers, masking methods that blind the intermediate values in the en/decryption computations are well-known among these countermeasures. But the cost of non-linear part is extremely high in the masking method of block cipher, and so the countermeasure for S-box must be efficiently constructed in the case of AES, ARIA and SEED. Existing countermeasures for S-box use the masked S-box table to require 256 bytes RAM corresponding to one S-box. But, the usage of the these countermeasures is not adequate in the lightweight security devices having the small size of RAM. In this paper, we propose the new countermeasure not using the masked S-box table to make up for this weak point. Also, the new countermeasure reduces time-complexity as well as the usage of RAM because this does not consume the time for generating masked S-box table.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_2
• /
• pp.1179-1192
• /
• 2018

In order to detect the Antarctic Polar Front (PF) among the main fronts in the Southern Ocean, this study is based on the combinations of satellite-based sea surface temperature (SST) and height (SSH) observations. For accurate PF detection, we classified the signals as front or non-front grids based on the Bayesian decision theory from daily SST and SSH datasets, and then spatio-temporal synthesis has been performed to remove primary noises and to supplement geographical connectivity of the front grids. In addition, sea ice and coastal masking were employed in order to remove the noise that still remains even after performing the processes and morphology operations. Finally, we selected only the southernmost grids, which can be considered as fronts and determined as the monthly PF by a linear smoothing spline optimization method. The mean positions of PF in this study are very similar to those of the PFs reported by the previous studies, and it is likely to be well represents PF formation along the bottom topography known as one of the major influences of the PF maintenance. The seasonal variation in the positions of PF is high in the Ross Sea sector (${\sim}180^{\circ}W$), and Australia sector ($120^{\circ}E-140^{\circ}E$), and these variations are quite similar to the previous studies. Therefore, it is expected that the detection approach for the PF position applied in this study and the final composite have a value that can be used in related research to be carried out on the long term time-scale.