• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.8
• /
• pp.165-170
• /
• 2020

As the IoT (Internet of Things) era is activated, a lot of information including personal information is being transmitted through IoT devices. For information protection, it is important to perform cryptography communication, and it is required to use a lightweight security protocol due to performance limitations. Currently, most of the encryption methods used in the security protocol use RSA and ECC (Elliptic Curve Cryptography). However, if a high performance quantum computer is developed and the Shor algorithm is used, it can no longer be used because it can easily solve the stability problems based on the previous RSA and ECC. Therefore, in this paper, we designed a security protocol that is resistant to the computational power of quantum computers. The code-based crypto ROLLO, which is undergoing the NIST (National Institute of Standards and Technology) post quantum cryptography standardization, was used, and a hash and XOR computation with low computational consumption were used for mutual communication between IoT devices. Finally, a comparative analysis and safety analysis of the proposed protocol and the existing protocol were performed.

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

In 1998, A. Young and M. Yung proposed the auto-recovery auto-certificate cryptosystem in public key infrastructure. We propose the new recoverable cryptosystem in public key infrastructure which is designed with the concept of A. Young et al's auto-recovery auto-certificate cryptosystem. It has the private/public key pairs of the user and the master private/public key pairs of the escrow authority. It is based on RSA cryptosystem and has efficiency and security.

• Review of KIISC
• /
• v.33 no.1
• /
• pp.51-58
• /
• 2023

차세대 컴퓨터인 양자 컴퓨터는 현재 정보화시스템에서 널리 사용되고 있는 공개키 암호 시스템인 RSA와 Elliptic Curve Cryptography (ECC)의 안전성을 위협하고 있다. 특히 양자 알고리즘인 Shor 알고리즘은 RSA와 ECC가 기반하고 있는 수학적 난제들을 다항 시간 내에 해결할 수 있기 때문에 NIST에서는 양자컴퓨터 상에서 내성을 가진 공개키 암호 표준화 공모전을 개최하였다. 2022년도에 NIST에서는 4개의 3라운드 최종 표준화 알고리즘을 발표하였다. 이와 동시에, 4라운드 표준화 알고리즘을 진행함으로써, 공개키 분야에서 코드 기반 또는 아이소제니 기반의 새로운 암호 알고리즘을 추가로 표준화할 예정이다. 이에 본 논문에서는 NIST 양자 내성 암호 표준화 공모전 4라운드의 후보 알고리즘인 코드 기반 암호 Classic McEliece, BIKE, HQC와 아이소제니 기반 암호 SIKE의 최신 동향에 대해 확인해본다. 추가적으로, 해당 암호 알고리즘에 대한 분석 기법과 공격 사례에 대해 살펴보고록 한다.

• Journal for History of Mathematics
• /
• v.20 no.1
• /
• pp.103-111
• /
• 2007

1997년 Coppersmith는 소인수분해를 모르는 법 N에 대한 합동방정식(modular equation)의 '작은 해'를 찾는 방법을 제안한다. 동시에 두 변수 다항식의 제한된 크기의 해를 찾는 방법도 격자이론을 이용하여 제안한다. 이러한 Coppersmith의 정리는 이후 암호학에서 매우 유용하게 사용되는데 특별히 RSA 암호체계에서 비밀 키를 찾아내거나 일부 비밀 키가 노출되었을 때 전체키를 복원하는 데에 중요한 역할을 한다. 본 논문에서는 Coppersmith의 정리를 살펴보고 이것이 RSA의 안전성에 어떠한 영향을 주었는지를 살펴본다.

• Proceedings of the Optical Society of Korea Conference
• /
• 2002.07a
• /
• pp.158-159
• /
• 2002

오늘날에도 RSA암호문은 현대 암호에 대부분 적용될 정도로 안전하다고 생각되어왔다. 또한 PGP(Pretty Good Privacy)라는 가장 대중적인 암호화 소프트웨어도 RSA 원리를 기반으로 하고 있다. 그러나 RSA암호화체계는 주요한 결점이 있다. 인수분해하는 것이 ＂어렵다＂라고 하지만, 결코 증명되지 않았고, 또한 인수분해를 수행하는 아주 빠른 알고리즘의 존재가 전혀 불가능하지는 않기 때문이다. 따라서 현존하는 암호화 체계보다 더 확실한 안전을 보장해주는 새로운 암호화 체계와 암호화키의 분배시스템의 필요성이 대두되고 있다. (중략)

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2021

This paper proposes to automate the process of predicting crypto-operations from the power signal generated in RSA decoding process by frequency analysis and K-means algorithm. RSA decoding process is divided into square and multiply operation, and if we can predict the type of operations over time, we will know the RSA key value. After converting the power signal generated in the process of decoding into two-dimensional frequency signal, this paper used K-means algorithm to classify the frequency vector according to the type of operation. these classified frequency vector were used to predict the types of operations.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.319-327
• /
• 2004

This paper describes implementations and test results of Elliptic Curve Cryptography (ECC) and Elliptic Curve KCDSA(ECKCDSA) algorithms based on Java card. 163-Bit ECC guarantees as secure as 1024-Bit Rivest-Shamir-Adleman (RSA) public key algorithm, which has been frequently used until now. According to our test results, 163-bit ECC processing time is about five times fast compared with 1024-bit RSA and amount of resource usages of ECC is smaller than RSA. Therefore, ECC is more appropriate for use on secure devices such as smart cards and wireless devices with constrained computational power consumption and small memory resources.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.674-677
• /
• 2003

Modern society is information-oriented society that allow letters in electron, telecommunication, computer, highly Information-Communication and information processing by great development of semi-conductor technologies. All businesses are depending on computer. Also, Great many user according to development who is worth watching eagerly of computer network and utilization of database and technology could collect, search, handle, transmit and store data at the same time using computer. But, while processing and use of information that use computer become convenient, exposure of data became serious relatively. For these reason, Security problem of data that need the secret rose. Accordingly, new encryption methods to use computer for security of data are presented and are developed continuously. Studied about DES, 3DES, RSA, ECC algorithm to select cipher algorithm to use in research hereafter in this treatise.

• Review of KIISC
• /
• v.1 no.2
• /
• pp.63-75
• /
• 1991

창간호에 이어 본고에서는 공개 키 암호시스템(public key dryptosystem)중 Merkle- sack 방법과 RSA공개 키 암호시스템 그리고 McEoiece 공개키 암호 시스템에 대한 자세한 분석을 기술하고자 한다.

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