• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.111-117
• /
• 2005

The period of a recent streamcipher proposal Edon80 is analyzed. The designers of Edon80 had projected a period of $2^{103}$ Even though this could indeed be the average keystream Period, we show that for a randomly chosen key-IV pair, there exists a non-dismissible probability that the produced keystream will be of relatively short period. More explicitly, a keystream of period. $2^{55}$ may appear with probability $2^{-71}$, and one can show the existence of at least one key-lV pair producing a period $2^{11}$ keystream.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.6
• /
• pp.1207-1214
• /
• 2019

Technologies of the 4th industrial revolution have been unknowingly seeping into our lives. Many IoT based home security systems are using the convolutional neural network(CNN) as good biometrics to recognize a face and protect home and family from intruders since CNN has demonstrated its excellent ability in image recognition. In this paper, three layouts of CNN for 2D and 2.5D image of small dataset with various input image size and filter size are explored. The simulation results show that the layout of CNN with 50*50 input size of 2.5D image, 2 convolution and max pooling layer, and 3*3 filter size for small dataset of 2.5D image is optimal for a home security system with recognition accuracy of 0.966. In addition, the longest CPU time consumption for one input image is 0.057S. The proposed layout of CNN for a face recognition is suitable to control the actuators in the home security system because a home security system requires good face recognition and short recognition time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.2
• /
• pp.19-26
• /
• 1997

In this paper, we propose an RSA multisignature scheme with no bit expansion in which the signing order is not restricted. In this scheme we use RSA moduli with the same bit length. the most 1 bits of which are same. The proposed scheme is based on these RSA moduli and a repeated exponentiation of Levine and Brawley. Kiesler and Harn first utilize the repeated exponentiation technique in their multisignature scheme, which requires 1.5m exponentiations for signing, where m is the number of signers. However, the proposed scheme requires (equation omitted) m exponentiation. So if l is sufficiently large (l $\geq$ 32), then we can neglect the vaue (equation omitted

• Convergence Security Journal
• /
• v.21 no.2
• /
• pp.67-79
• /
• 2021

Lessons Learned(LL) is a military term defined as all activities that promote future development by finding problems and need improvement in education and reality in the field of warfare development. In this paper, we focus on presenting actual examples and applying AI analysis inference techniques to solve revealed problems in promoting LL activities, such as long-term analysis, budget problems, and necessary expertise. AI legal advice services using cognitive computing-related technologies that have already been practical and in use, were judged to be the best examples to solve the problems of LL. This paper presents intelligent LL inference techniques, which utilize AI. To this end, we want to explore theoretical backgrounds such as LL analysis definitions and examples, evolution of AI into Machine Learning, cognitive computing, and apply it to new technologies in the defense sector using the newly proposed L²-OODA ensemble algorithm to contribute to implementing existing power improvement and optimization.

• Communications of the Korean Mathematical Society
• /
• v.21 no.1
• /
• pp.65-74
• /
• 2006

In this paper, we will define the Bergman projection type operator Pr and find conditions on which the operator Pr is bound-ed on $L^p$(B, dv). By using the properties of the Bergman projection type operator Pr, we will show that if $f{\in}L_a^p$(B, dv), then $(1-{\parallel}{\omega}{\parallel}^2){\nabla}f(\omega){\cdot}z{\in}L^p(B,dv)$. We will also show that if $(1-{\parallel}{\omega}{\parallel}^2)\; \frac{{\nabla}f(\omega){\cdot}z}{},\;{\in}L^p{B,\;dv),\;then\;f{\in}L_a^p(B,\;dv)$.

• The Journal of Asian Finance, Economics and Business
• /
• v.8 no.4
• /
• pp.857-861
• /
• 2021

The study aims to find the asymmetric effect in National Stock Exchange in which the Nifty50 is considered as proxy for NSE. A return can be stated as the change in value of a security over a certain time period. Volatility is the rate of change in security value. It is an arithmetical assessment of the dispersion of yields of security prices. Stock prices are extremely unpredictable and make the investment in equities risky. Predicting volatility and modeling are the most profuse areas to explore. The current study describes the association between two variables, namely, stock yields and volatility in equity market in India. The volatility is measured by employing asymmetric GARCH technique, i.e., the EGARCH (1,1) tool, which was used in building the study. The closing prices of Nifty on day-to-day basis were used for analysis from the period 2011 to 2020 with 2,478 observations in the study. The model arrests the lopsided volatility during the mentioned period. The outcome of asymmetric GARCH model revealed the subsistence of leverage effect in the index and confirms the impact of conditional variance as well. Furthermore, the EGARCH technique was evidenced to be apt in seizure of unsymmetrical volatility.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.780-790
• /
• 2011

This paper presents an efficient differential power analysis (DPA) countermeasure for the $Eta_T$ pairing algorithm over GF($2^n$). The proposed algorithm is based on a random value addition (RVA) mechanism. An RVA-based DPA countermeasure for the $Eta_T$ pairing computation over GF($3^n$) was proposed in 2008. This paper examines the security of this RVA-based DPA countermeasure and defines the design principles for making the countermeasure more secure. Finally, the paper proposes an efficient RVA-based DPA countermeasure for the secure computation of the $Eta_T$ pairing over GF($2^n$). The proposed countermeasure not only overcomes the security flaws in the previous RVAbased method but also exhibits the enhanced performance. Actually, on the 8-bit ATmega128L and 16-bit MSP430 processors, the proposed method can achieve almost 39% and 43% of performance improvements, respectively, compared with the best-known countermeasure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.654-656
• /
• 2016

MACsec is a cryptographic function that operates on Layer 2. As industries such as IoT(Internet of Things) devices are receiving attention recently are connected to the network and Internet traffic is increasing rapidly. Because of today, Becoming the increase in traffic and complex situations to protect the overall traffic, not just certain parts. The MACsec technology has received attention. In this paper, Layer 2 security technology to MACsec. Design the technology MACsec adapter that can easily and readily added to existing Layer 2 network.

• Review of KIISC
• /
• v.18 no.2
• /
• pp.23-32
• /
• 2008

유비쿼터스 환경에서는 IT서비스에 사람뿐만 아니라 기기 및 사물 등이 참여하고 다양한 인증수단이 사용된다. 하지만, u-IT서비스에 참여하는 개체에 대한 신뢰된 인증환경이 없다면 유비쿼터스 사회의 전체 신뢰도가 떨어지는 결과를 초래하게 된다. 본 논문에서는 유비쿼터스 환경의 신뢰된 인증 환경 조성을 위한 프레임워크로서 u-lT 서비스에 인증서비스를 도입하기 위한 절차와 u-lT 서비스 위험평가 방법 및 인증수단 선택기준 등의 보안요구사항을 제시한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.1
• /
• pp.65-70
• /
• 2006

It is hewn that we can apply algebraic attacks on combiners with memory such as summation generators. [1,8] To apply algebraic attacks on combiners with memory, we need to construct algebraic relations between the keystream bits and the initial bits of the LFSRs. Until now, all known methods produce algebraic relations involving several consecutive bits of keystream. [l.4.8] In this paper, we show that algebraic relations involving only one keystream bit can be constructed for summation generators. We also show that there is an algebraic relation involving only one keystream bit for ISG (9) proposed by Lee and Moon. Using this fact, we analyze the keystream generators which generate the keystreams by combining summation generators.