• Journal of Convergence for Information Technology
• /
• v.8 no.1
• /
• pp.139-145
• /
• 2018

Ransomeware is a kind of malware. Computers infected with Ransomware have limited system access. It is a malicious program that must provide a money to the malicious code maker in order to release it. On May 12, 2017, with the largest Ransomware attack ever, concerns about the Internet security environment are growing. The types of Ransomware and countermeasures to prevent cyber terrorism are discussed. Ransomware, which has a strong infectious nature and has been constantly attacked in recent years, is typically in the form of Locky, Petya, Cerber, Samam, and Jigsaw. As of now, Ransomware defense is not 100% free. However, it can counter to Ransomware through automatic updates, installation of vaccines, and periodic backups. There is a need to find a multi-layered approach to minimize the risk of reaching the network and the system. Learn how to prevent Ransomware from corporate and individual users.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.1
• /
• pp.43-54
• /
• 2002

McEliece introduced a public-key cryptosystem based on Algebraic codes, specially binary classical Goppa which have a good decoding algorithm and vast number of inequivalent codes with given parameters. And the advantage of this system low cost of their encryption and decryption procedures compared with other public-key systems specially RSA, ECC based on DLP(discrete logarithm problem). But in [1], they resent new attack based on probabilistic algorithm to find minimum weight codeword, so for a sufficient security level, much larger parameter size [2048, 1608,81]is required. Then the big size of public key make McEliece PKC more inefficient. So in this paper, we will propose New Type PKC using q-ary Hyperelliptic code so that with smaller parameter(1 over 3) but still work factor as hi인 as McEliece PKC and faster encryption, decryption can be maintained.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.701-704
• /
• 2007

Recently, More and more consumer enjoy the finance service such as settling, account transferring, stocks investment, and so via mobile device. In the mobile environment, data transferring between the devices is formatted as XML. However, the common XML file is exposed to the attack such as hacking and malignity code, to satisfy security of mobile environment is very difficult. The problem is more seriously at the open platform such as WIPI that is developed by our country. So there is enough reason to propose one system to protect the import data. In this paper, we development the system to digital signature and signature the XML document in order to protect data, and the system is observing the recommendation of the XML Signature Syntax and Processing by W3C. When designing and composition the system, we use the digital signature algorithm RSA, DSA, KCDSA, and HMAC, etc. we test the system at the open WIPI platform.

• Journal of the Korean Geotechnical Society
• /
• v.37 no.9
• /
• pp.13-24
• /
• 2021

Recently, attempts have been made to detect fouling patterns in the ground using Ground Penetrating Radar (GPR) during the maintenance of gravel ballast railway tracks. However, dealing with GPR signal data obtained with a large amount of noise in a site where complex ground conditions are mixed, often depends on the experience of experts, and there are many difficulties in precise analysis. Therefore, in this study, a numerical modeling technique that can quantitatively simulate the GPR signal characteristics according to the degree of fouling of the gravel ballast material was proposed using python-based open-source code gprMax and RSA (Random sequential Absorption) algorithm. To confirm the accuracy of the simulation model, model tests were manufactured and the results were compared to each other. In addition, the identification of the fouling layer in the model test and analysis by various test conditions was evaluated and the results were analyzed.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.103-110
• /
• 2013

In Information Technology era, various amazing IT technologies, for example Big Data, are appearing and are available as the amount of information increase. The number of counselling for violation of personal data protection is also increasing every year that it amounts to over 160,000 in 2012. According to Korean Privacy Act, in the case of treating unique personal identification information, appropriate measures like encipherment should be taken. The technologies of encipherment are the most basic countermeasures for personal data invasion and the base elements in information technology. So various cryptography algorithms exist and are used for encipherment technology. Therefore studies on safer new cryptography algorithms are executed. Cryptography algorithms started from classical replacement enciphering and developed to computationally secure code to increase complexity. Nowadays, various mathematic theories such as 'factorization into prime factor', 'extracting square root', 'discrete lognormal distribution', 'elliptical interaction curve' are adapted to cryptography algorithms. RSA public key cryptography algorithm which was based on 'factorization into prime factor' is the most representative one. This paper suggests algorithm utilizing telescoping series as a safer cryptography algorithm which can maximize the complexity. Telescoping series is a type of infinite series which can generate various types of function for given value-the plain text. Among these generated functions, one can be selected as a original equation. Some part of this equation can be defined as a key. And then the original equation can be transformed into final equation by improving the complexity of original equation through the command of "FullSimplify" of "Mathematica" software.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.4
• /
• pp.683-688
• /
• 2021

Digital signature algorithms such as RSA and ECDSA are threatened by the development of quantum computer technology, which is attracting attention as a future technology. Alternatively, various post-quantum algorithms such as grid-based, multivariate-based, code-based, and hash-based are being studied. Among them, the hash-based is a fast and quantitative security level that can be calculated and its safety has been proven. So it is receiving a lot of attention. In this paper, we examine various hash-based digital signature algorithms that have been proposed so far, and analyze their features and their strengths and weaknesses. In addition, we emphasize the importance of reducing the size of the signature in order for the hash-based signature algorithm to be practically used.

• Structural Engineering and Mechanics
• /
• v.87 no.4
• /
• pp.347-361
• /
• 2023

This research aims to assess the behavior of reinforced concrete (RC) residential buildings when moment-resisting frames (MRFs) are used as the lateral resisting system. This investigation was conducted using MIDAS Gen v.19.0. Buildings with various plan footprints (Square, Rectangular, Circular, Triangular, and Plus-Shaped), and different heights (15 m, 30 m, 45 m, and 60 m) are investigated. The defined load cases, the equivalent static lateral load pattern, and the response spectrum function were defined as stated by the American Standard (ASCE 7-16), the 1997 Uniform Building Code (UBC97), the Egyptian Code for Loads (ECP-201), and the European Standard (EC8). Extensive comparisons of the results obtained by the different codes (including the story displacement, the story drift, and the base shear) were undertaken; to assess the response of moment-resisting multi-story framed buildings under lateral loads. The results revealed that, for all study cases under consideration, both ECP-201 and EC8 gave smaller base shear, displacement, and drift by one third to one fourth, around one fourth, around one fifth, respectively for both the ELF and RSA methods if compared to ASCE 7-16 and UBC97.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.167-170
• /
• 2021

현재, 주요 선진국들을 포함하여 Google과 IBM과 같은 국제 대기업들을 필두로 양자 컴퓨터 개발에 전폭적인 투자들을 하고 있다. 양자 컴퓨터는 특정 분야에 있어 월등한 계산 능력을 보여주며, 기존 컴퓨터에서는 해결할 수 없던 몇몇 문제들을 빠른 시간 내에 해결한다. 이러한 양자 컴퓨터의 등장은 기존 컴퓨터에서는 사실상 풀 수 없는 암호 알고리즘들을 빠른 시간 내에 해결하여 암호학계에 큰 위협이 되고 있다. 현재 사용하고 있는 대부분의 공개키 암호 알고리즘인 RSA와 ECC(Elliptic Curve Cryptography) 또한 공격 대상이다. NIST에서는 다가오는 양자 컴퓨터 시대에 대비하여 양자내성암호 공모전을 주최하였으며 현재 라운드 3에 도입하였다. 본 논문에서는 라운드 3의 후보 알고리즘인 코드기반암호를 공격하는 ISD(Information Set Decoding) 알고리즘에 관한 동향을 조사하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1573-1581
• /
• 2006

To utilize actively the agent which is one of the elements of revitalization of Agro-Foods Mobile I-commerce, an essential prerequisite is agent security. IF using partial PKI(Public Key Infrastructure)-based confirmation mechanism providing security for the agent, the size of agent is becoming larger, the result of the transmission speed is slow, and the confirmation speed is tardy as well because of performing calculation of public keys such as RSA and needing linkage with the CA for the valid examination of certificates. This paper suggests a mechanism that can cross certification and data encryption of each host in the side of improving the problems of key distribution on agent by shaping key chain relationship. This mechanism can guarantee the problem of ky distribution by using agent cipher key(ACK) module and generating random number to fit mobile surroundings and to keep the secret of the agent. Suggested mechanism is a thing that takes into consideration security and efficiency to secure agent for the revitalization of M-Commerce, and is a code skill to make the agent solid and is a safe mechanism minimizing the problems of memory overflow.

• Communications of Mathematical Education
• /
• v.26 no.4
• /
• pp.351-362
• /
• 2012

Until the 1950s, linear algebra was considered only as one of abstract and advanced mathematics subject among in graduate mathematics courses, mainly dealing with module in algebra. Since the 1960s, it has been a main subject in undergraduate mathematics education because matrices has been used all over. In Korea, it was considered as a course only for mathematics major students until 1980s. However, now it is a subject for all undergraduate students including natural science, engineering, social science since 1990s. In this paper, we investigate the early history of linear algebra and its development from a historical perspective and mathematicians who made contributions. Secondly, we explain why linear algebra became so popular in college mathematics education in the late 20th century. Contributions of Chinese and H. Grassmann will be extensively examined with many newly discovered facts.