Enhancing Koyama Scheme Using Selective Encryption Technique in RSA-based Singular Cubic Curve with AVK
نویسندگان
چکیده
This paper analyzes application of Selective Encryption with Automatic Variable Key (AVK) for text based documents in Koyama Public Key Cryptosystem (PKC). In this paper, a new robust and simple PKC based singular cubic curve cryptosystem over the ring Zn, using selective encryption with Automatic Variable Key (AVK), is proposed. In the proposed algorithm, selected parts of text document are encrypted/decrypted using any public key cryptosystem e.g. RSA algorithm based singular cubic curve with AVK approach. The key is configured every time as Automatic Variable Key. Rest of the plain text after selection is either left as it is and can be encrypted/decrypted using a simple DES (Data Encryption Standard) approach. The balance of computational overhead is projected through the technique of selective encryption with AVK, which increases the speed of encryption/decryption and level of security as well. This paper illustrates how the selective encryption with AVK method increases security, robustness and speed of encryption in Koyama scheme. The enhanced algorithm suitably provides for authorization, authentication and confidentiality. The result obtained indicates increase in speed using selective encryption over the conventional technique. It can be established that the selective encryption has an edge over the existing techniques as far as time complexity is concerned.
منابع مشابه
On Security of Koyama Scheme
An attack is possible upon all three RSA analogue PKCs based on singular cubic curves given by Koyama. While saying so, Seng et al observed that the scheme become insecure if a linear relation is known between two plaintexts. In this case, attacker has to compute greatest common divisor of two polynomials corresponding to those two plaintexts. However, the computation of greatest common divisor...
متن کاملCryptanalysis of Koyama Scheme
In this paper we analyze the security of Koyama scheme based on the singular cubic curve for some well known attacks. We provide an efficient algorithm for linearly related plaintext attack and identify isomorphic attack on Koyama scheme. Some other attacks are also discussed in this paper.
متن کاملA New Attack on Three Variants of the RSA Cryptosystem
In 1995, Kuwakado, Koyama and Tsuruoka presented a new RSA-type scheme based on singular cubic curves y2 ≡ x3+bx2 (mod N) where N = pq is an RSA modulus. Then, in 2002, Elkamchouchi, Elshenawy and Shaban introduced an extension of the RSA scheme to the field of Gaussian integers using a modulus N = PQ where P and Q are Gaussian primes such that p = |P| and q = |Q| are ordinary primes. Later, in...
متن کاملAttack on RSA-Type Cryptosystems Based on Singular Cubic Curves over Z/nZ
Several RSA-type cryptosystems based on singular cubic curves have been proposed in recent years (cf. Koyama, Lecture notes in Computer Science, vol. 921, Springer, Berlin, 1995, pp. 329–339; Kuwakado, IEICE Trans. Fund. E78-A (1995) 27–33; Koyama, IEICE Trans. Fund. E77-A (1994) 1309–1318). We show that these schemes are equivalent and demonstrate that they are insecure if a linear relation is...
متن کاملA Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent attack. In this paper we propose a cryptosystem over singular cubic curve using the idea of Koyama and Kouichi et al. Our proposed cryptosystem is approximately two times faster than the cryptosystem given by Kouichi et...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 14 شماره
صفحات -
تاریخ انتشار 2012