• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.177-182
• /
• 1998

This paper proposes pure master key which can be commonly used in multi-cryptographic system. It also refer to master key condition for RSA public key cryptosystem using Format's theorem and master key algorithm as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.479-488
• /
• 2016

For a secure communication system, it is necessary to use secure cryptographic algorithms and keys. Modern cryptographic system generates high entropy encryption key through standard key derivation functions. Using recent progress in quantum key distribution(QKD) based on quantum physics, it is expected that we can enhance the security of modern cryptosystem. In this respect, the study on the dual key agreement is required, which combines quantum and modern cryptography. In this paper, we propose two key derivation functions using dual key agreement based on QKD and RSA cryptographic system. Furthermore, we demonstrate several simulations that estimate entropy of derived key so as to support the design rationale of our key derivation functions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.839-842
• /
• 2001

자바카드 API는 스마트 카드와 같은 작은 메모리를 가진 임베디드 장치에서 실행환경을 최적화하기 위해 구성되었다. 자바카드 API의 목적은 한정된 메모리를 가진 스마트카드 기반의 프로그램을 개발한 때 많은 이점을 제공한다. 본 논문에서는 자바 카드 API를 이용하여 공개키 암호 알고리즘 중에서 대표적인 RSA 알고리즘을 구현하는 것에 목적을 둔다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.517-520
• /
• 2004

자바카드 API는 스마트 카드와 같은 작은 메모리를 가진 임베디드 장치에서 실행환경을 최적화하기 위해 구성되었다. 자바카드 API의 목적은 한정된 메모리를 가진 스마트카드 기반의 프로그램을 개발할 때 많은 이점을 제공한다. 본 논문에서는 자바 카드 API를 이용하여 공개키 암호 알고리즘 중에서 대표적인 RSA 알고리즘 구현하는 것에 목적을 둔다.

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.71-81
• /
• 2015

The RSA public key encryption algorithm, a few, key generation, factoring, the Euler function, key setup, a joint expression law, the application process are serial indexes. The foundation of such algorithms are mathematical principles. The first concept from mathematics principle is applied from how to obtain a minority. It is to obtain a product of two very large prime numbers, but readily tracking station the original two prime number, the product are used in a very hard principles. If a very large prime numbers p and q to obtain, then the product is the two $n=p{\times}q$ easy station, a method for tracking the number of p and q from n synthesis and it is substantially impossible. The RSA encryption algorithm, the number of digits in order to implement the inverse calculation is difficult mathematical one-way function and uses the integer factorization problem of a large amount. Factoring the concept of the calculation of the mod is difficult to use in addition to the problem in the reverse direction. But the interests of the encryption algorithm implementation usually are focused on introducing the film the first time you use encryption algorithm but we have to know how to go through some process applied to the field work This study presents a field force applied encryption process scheme based on public key algorithms attribute diagnosis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.7
• /
• pp.651-662
• /
• 1991

An improved modular multiplication algorithm for RSA type public key cryptosystem and its application to a serial communication cricuit are presented. Correction on a published fast modular multiplication algorithm is proposed and verified thru simulation. Cryptosystem for RS 232C communication protocol isdesigned and prototyped for low speed data exchange between computers. The system adops the correct algoroithm and operates successfully using a small size key.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.3
• /
• pp.217-223
• /
• 2009

Recently, the development of the various network method can generate serious social problems. So, it is highly required to control security of network. These problems related security will be developed and keep up to confront with anti-security field such as hacking, cracking. The way to preserve security from hacker or cracker without developing new cryptographic algorithm is keeping the state of anti-cryptanalysis in a prescribed time by means of extending key-length. In this paper, the proposed montgomery multiplication structured unit array method in carry generated part and variable length multiplication for eliminating bottle neck effect with the RSA cryptosystem. Therefore, this proposed montgomery multiplier enforce the real time processing and prevent outer cracking.

• Review of KIISC
• /
• v.33 no.2
• /
• pp.49-56
• /
• 2023

양자 컴퓨터의 기술이 발전됨에 따라 Shor 알고리즘과 Grover 알고리즘을 통해 기존의 공개키, 대칭키 및 해시 암호체계에 위협을 줄 수 있다. RSA 및 ECC 암호체계는 Shor 알고리즘에 의해 다항시간 내에 해독이 가능해진다. 이러한 보안위협의 증가로 양자내성의 성질을 지닌 양자내성암호가 주목받고 있으며 양자내성 전자서명을 블록체인의 전자서명에 적용하기 위한 다양한 연구가 진행되고 있다. 본 논문에서는 양자내성암호를 블록체인의 전자서명에 적용하는 연구동향에 대해 설명한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1121-1130
• /
• 2016

RSA cryptosystem is one of the most widely used public key cryptosystem. The security of RSA cryptosystem is based on hardness of factoring large number and hence there are ongoing attempt to factor RSA modulus. General Number Field Sieve (GNFS) is currently the fastest known method for factoring large numbers so that CADO-NFS - publicly well-known software that was used to factor RSA-704 - is also based on GNFS. However, one disadvantage is that CADO-NFS could not always select the optimal polynomial for given parameters. In this paper, we analyze CADO-NFS's polynomial selection stage. We propose modified polynomial selection using Chinese Remainder Theorem and Euclidean Distance. In this way, we can always select polynomial better than original version of CADO-NFS and expected to use for factoring RSA-1024.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.4
• /
• pp.951-959
• /
• 2017

Under the assumption that there is available some additional information other than plaintext-ciphertext pairs, the security of the RSA cryptosystem has been analyzed by the attack methods such as the side-channel attacks and the lattice-based attacks. Recently, based on the data retention property of the powered-off DRAMs, the so called cold boot attack was proposed in the literature, which is focusing on recovering the various cryptosystems' key from some auxiliary information. This paper is dealing with the problem of recovering the RSA private key with erasures and errors and proposes a new key recovery algorithm which is shown to have better performance than the previous one introduced by Kunihiro et al.