2012•The Journal of the Korea institute of electronic communication sciencesRequires access
Computational Complexity in Imaginary Quadratic Order
Yongtae Kim
Open publisher page 0 citations
Abstract
In this paper, we propose a new cryptosystem based on the IQC depended on the complexity of class number and intractibility of factoring integer, and introduce two algorithm which reduce encryption and decryption times. To recognize the security of the cryptosystem, we take a simple example to analyze the complexities of public key and secret key and then introduce the operating process of the cryptosystem.