• Title/Summary/Keyword: generating polynomial

Search Result 76, Processing Time 0.023 seconds

A Study on S-Function in SEED Cryptosystem (SEED암호에서 S-함수에 대한 고찰)

  • Yang, Jeong-Mo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.6
    • /
    • pp.1295-1305
    • /
    • 2017
  • There is SEED cryptosystem in domestic block cipher standard. This code was drafted by the Korea Information Security Agency (KISA) in October 1998 and underwent a public verification process in December of the same year, which resulted in the final amendment to improve safety and performance. Unlike DES, it is a 128-bit block cipher that has been passed through various processes and established in 2005 as an international standard. It is a block cipher with a pastel structure like DES, but the input bit block has been increased to 128 bits, double DES. In this paper, first, we introduce the general algorithm of SEED cryptosystem and analyzed mathematically generating principle of key-value which is used in F-function. Secondly, we developed a table that calculates the exponent of the primitive element ${\alpha}$ corresponding to the 8-bit input value of the S-function and finally analyzed calculating principle of S-function designed in G-function through the new theorem and example. Through this course, we hope that it is to be suggest the ideas and background theory needed in developing new cryptosystem to cover the weakness of SEED cryptosystem.

A Study on Performance Improvement of Non-Profiling Based Power Analysis Attack against CRYSTALS-Dilithium (CRYSTALS-Dilithium 대상 비프로파일링 기반 전력 분석 공격 성능 개선 연구)

  • Sechang Jang;Minjong Lee;Hyoju Kang;Jaecheol Ha
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.1
    • /
    • pp.33-43
    • /
    • 2023
  • The National Institute of Standards and Technology (NIST), which is working on the Post-Quantum Cryptography (PQC) standardization project, announced four algorithms that have been finalized for standardization. In this paper, we demonstrate through experiments that private keys can be exposed by Correlation Power Analysis (CPA) and Differential Deep Learning Analysis (DDLA) attacks on polynomial coefficient-wise multiplication algorithms that operate in the process of generating signatures using CRYSTALS-Dilithium algorithm. As a result of the experiment on ARM-Cortex-M4, we succeeded in recovering the private key coefficient using CPA or DDLA attacks. In particular, when StandardScaler preprocessing and continuous wavelet transform applied power traces were used in the DDLA attack, the minimum number of power traces required for attacks is reduced and the Normalized Maximum Margines (NMM) value increased by about 3 times. Conseqently, the proposed methods significantly improves the attack performance.

Development of a Short-term Rainfall Forecast Model Using Sequential CAPPI Data (연속 CAPPI 자료를 이용한 단기강우예측모형 개발)

  • Kim, Gwangseob;Kim, Jong Pil
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.29 no.6B
    • /
    • pp.543-550
    • /
    • 2009
  • The traditional simple extrapolation type short term quantitative rainfall forecast can not realize the evolution of rainfall generating weather system. To overcome the drawback of the linear extrapolation type rainfall forecasting model, the history of a weather system from sequential weather radar information and a polynomial regression technique were used to generate forecast fileds of x-directional, y-directional velocities and radar reflectivity which considered the nonlinear behavior related to the evolution of weather systems. Results demonstrated that test statistics of forecasts using the developed model is better than that of 2-CAPPI forecast. However there is still a large room to improve the forecast of spatial and temporal evolution of local storms since the model is not based on a fully physical approach but a statistical approach.

Automated Improvement of RapidEye 1-B Geo-referencing Accuracy Using 1:25,000 Digital Maps (1:25,000 수치지도를 이용한 RapidEye 위성영상의 좌표등록 정확도 자동 향상)

  • Oh, Jae Hong;Lee, Chang No
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.5
    • /
    • pp.505-513
    • /
    • 2014
  • The RapidEye can acquire the 6.5m spatial resolution satellite imagery with the high temporal resolution on each day, based on its constellation of five satellites. The image products are available in two processing levels of Basic 1B and Ortho 3A. The Basic 1B image have radiometric and sensor corrections and include RPCs (Rational Polynomial Coefficients) data. In Korea, the geometric accuracy of RapidEye imagery can be improved, based on the scaled national digital maps that had been built. In this paper, we present the fully automated procedures to georegister the 1B data using 1:25,000 digital maps. Those layers of map are selected if the layers appear well in the RapidEye image, and then the selected layers are RPCs-projected into the RapidEye 1B space for generating vector images. The automated edge-based matching between the vector image and RapidEye improves the accuracy of RPCs. The experimental results showed the accuracy improvement from 2.8 to 0.8 pixels in RMSE when compared to the maps.

Low Space Complexity Bit Parallel Multiplier For Irreducible Trinomial over GF($2^n$) (삼항 기약다항식을 이용한 GF($2^n$)의 효율적인 저면적 비트-병렬 곱셈기)

  • Cho, Young-In;Chang, Nam-Su;Kim, Chang-Han;Hong, Seok-Hie
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.12
    • /
    • pp.29-40
    • /
    • 2008
  • The efficient hardware design of finite field multiplication is an very important research topic for and efficient $f(x)=x^n+x^k+1$ implementation of cryptosystem based on arithmetic in finite field GF($2^n$). We used special generating trinomial to construct a bit-parallel multiplier over finite field with low space complexity. To reduce processing time, The hardware architecture of proposed multiplier is similar with existing Mastrovito multiplier. The complexity of proposed multiplier is depend on the degree of intermediate term $x^k$ and the space complexity of the new multiplier is $2k^2-2k+1$ lower than existing multiplier's. The time complexity of the proposed multiplier is equal to that of existing multiplier or increased to $1T_X(10%{\sim}12.5%$) but space complexity is reduced to maximum 25%.

A Feasibility Study for Mapping Using The KOMPSAT-2 Stereo Imagery (아리랑위성 2호 입체영상을 이용한 지도제작 가능성 연구)

  • Lee, Kwang-Jae;Kim, Youn-Soo;Seo, Hyun-Duck
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.15 no.1
    • /
    • pp.197-210
    • /
    • 2012
  • The KOrea Multi-Purpose SATellite(KOMPSAT)-2 has a capability to provide a cross-track stereo imagery using two different orbits for generating various spatial information. However, in order to fully realize the potential of the KOMPSAT-2 stereo imagery in terms of mapping, various tests are necessary. The purpose of this study is to evaluate the possibility of mapping using the KOMPSAT-2 stereo imagery. For this, digital plotting was conducted based on the stereoscopic images. Also the Digital Elevation Model(DEM) and an ortho-image were generated using digital plotting results. An accuracy of digital plotting, DEM, and ortho-image were evaluated by comparing with the existing data. Consequently, we found that horizontal and vertical error of the modeling results based on the Rational Polynomial Coefficient(RPC) was less than 1.5 meters compared with the Global Positioning System(GPS) survey results. The maximum difference of vertical direction between the plotted results in this study and the existing digital map on the scale of 1/5,000 was more than 5 meters according as the topographical characteristics. Although there were some irregular parallax on the images, we realized that it was possible to interpret and plot at least seventy percent of the layer which was required the digital map on the scale of 1/5,000. Also an accuracy of DEM, which was generated based on the digital plotting, was compared with the existing LiDAR DEM. We found that the ortho-images, which were generated using the extracted DEM in this study, sufficiently satisfied with the requirement of the geometric accuracy for an ortho-image map on the scale of 1/5,000.