• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.663-666
• /
• 2001

최근 해킹으로 인한 개인정보유출이 사회적으로 큰 문제가 되고 있다. 이러한 해킹의 강력한 대응 방법중의 하나인 암호화를 통해 개인의 정보유출을 방지하거나 안전도를 높일 수 있다. 이에 본 연구에서는 카오스 알고리즘을 이용한 암호화 방법을 제안한다. 이 카오스 알고리즘은 기존의 암호화 알고리즘인 DES, RSA와 비교되는 알고리즘으로 초기조건에 따라 완전히 다른 결과를 내는 카오스의 특징을 이용하였다.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.207-210
• /
• 2003

For the effective use of information in the information society, information should be protected and outflow of information by illegal users should be prevented. This study sets up user authentication policy, user authentication regulations and procedures for information protection and builds information protection key distribution center and encryption user Authentication system, which can protect information from illegal users.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1074-1076
• /
• 2010

최근 스마트폰이 크게 활성화됨에 따라 스마트폰에서 이용할 수 있는 인터넷전화가 급부상하고 있다. 그러나 인터넷전화는 인터넷망을 이용하기 때문에 요금이 저렴한 반면에 보안이 취약한 문제점을 가지고 있다. 이에 따라 본 논문에서는 도청방지를 위해 모바일 인터넷전화 시스템에 적합한 암호 알고리즘인 RSA, ECC 등을 비교 분석한다. 향후 모바일 인터넷전화 시스템 개발시 암호 알고리즘을 적용하는데 참고할 수 있다.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.309-318
• /
• 2004

AAAv6-based Diameter method is using in the user authentication to satisfy the users' increasing user authentication demand and to supply a safe communication between mobile node and server in the Mobile IP. therefore, In this paper, We design a model of server capacity based on EAP-TLS that in one of AAAv6 models with mobility among domains to get the optimized capacity index of the server for user authentication accomplishment. We elicitat the authentication capacity index for each server of which is accomplishing in user authentication using DSA/RSA algorithm and purpose the optimized condition for the AAAv6 capacity by the index.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1472-1491
• /
• 2011

As used product transactions are currently on the rise, the demand for transactions of secondhand digital content will grow in the future; thus, learning to make secure transactions while avoiding cyber attacks becomes an important issue. In this paper, we combine the new buyer's secret key, the new buyer's watermark to embed in resold digital content, and the reseller's encrypted watermark, which can prove legal ownership of the reseller. Using the privacy homomorphism property of RSA and exponential calculus, the original seller of digital content can verify the legality of the reseller and the new buyer. We also reduced the load of encryption/decryption digital content using a partial encryption/decryption algorithm to make our protocol more efficient and practical. In the proposed protocol, the seller is not able to conduct piracy and easily frame any other innocent secondhand buyer when a case of piracy is found. In fact, piracy can be clearly traced using the privacy homomorphism property of RSA and the embedded watermark mechanism. Further, in the proposed protocol, the seller himself can trace the piracy using exponential calculus. Since it is unnecessary to trust third party participation, the conspiracy problem is resolved and the new buyer is not required to participate in the dispute. Moreover, the seller, reseller and new buyer can simultaneously benefit from the secondhand transaction.

• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.243-250
• /
• 2012

This study proposes new protocol protecting patients' personal record more safely as well as solving medical dispute smoothly by storing the record not into a computer server in hospitals but into the National Health Insurance Corporation computer server. The new protocol for electronic medical record is designed using RSA public key algorithm and DSA digital signature. In addition, electronic medical record systems are built up with more safety and reliability through certificate authority. The proposed medical information systems can strengthen trust between doctors and patients. If medical malpractice occurs, the systems can also provide evidence. Furthermore, the systems can be helpful to reduce medical accidents. The systems could be also utilized efficiently in various applied areas.

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.185-189
• /
• 2012

It is almost impossible to directly find the prime factor, p,q of a large semiprime, n=pq. So Most of the integer factorization algorithms uses a indirect method that find the prime factor of the p=GCD(a-b,n),q=GCD(a+b,n) after getting the congruence of squares of the $a^2{\equiv}b^2$(mod n). Many methods of getting the congruence of squares have proposed, but it is not easy to get with RSA number of greater than a 100-digit number. This paper proposes a fast algorithm to get the congruence of squares. The proposed algorithm succeeded in getting the congruence of squares to a 19-digit number.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.6
• /
• pp.1181-1188
• /
• 2017

The unit and fundamental units of number fields are important to number field sieves testing primality of more than 400 digits integers and number field seive factoring the number in RSA cryptosystem, and multiplication of ideals and counting class number of the number field in imaginary quadratic cryptosystem. To minimize the time and space in H/W implementation of cryptosystems using fundamental units, in this paper, we introduce the Dirichlet's unit Theorem and propose our process of generating the fundamental units of the number field. And then we present the algorithm generating our fundamental units of the number field to minimize the time and space in H/W implementation and implementation results using the algorithm over the number field.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.394-402
• /
• 2010

At a recent, enterprises based on online-service are established because of rapid growth of information network. These enterprises collect personal information and do customer management. If customers use a paid service, company send billing information to customer and customer pay it. Such circulation and management of information is big issue but most companies don't care of information security. Actually, personal information that was managed by largest internal open-market was exposed. For safe customer information management, this paper proposes the method that decrease load of RSA cryptography algorithm that is commonly used for preventing from illegal attack or hacking. The method for decreasing load was designed by Binary NAF Method and it can operates modular Exponentiation rapidly. We implemented modular Exponentiation algorithm using existing Binary Method and Windows Method and compared and evaluated it.