INTEGRATION OF CFEA-COMPRESSION TECHNIQUE INTO ASYMMETRIC KEY CRYPTOSYSTEMS
DOI:
https://doi.org/10.11113/jt.v78.6922Keywords:
Compression Techique, RSA Cryptosystem, ElGamal Cryptosystem, Elliptic Curve Cryptosystem, Continued Fraction, Euclidean AlgorithmAbstract
In order to provide good level of security, modern cryptosystems need to implement large numbers and complicated mathematical operations. As a consequence, efficiency becomes a new major issue in cryptography. By using proper parameters, some of established asymmetric cryptosystems are believed to be able to provide a good level of security. Since that, aim to develop a mechanism to accelerate encryption and decryption processes of asymmetric cryptosystem without altering their original encryption and decryption algorithms become a big consideration. The aim of this paper is to propose the integration of a compression technique that named as CFEA-Compression technique into some established asymmetric key cryptosystem such as RSA, El-Gamal and Elliptic Curve cryptosystems. CFEA-technique is a combination of Continued Fraction and Euclidean Algorithm (CFEA) which is able to reduce the number of plaintext and ciphertext prior the encryption and decryption procedures.
References
Hoffstein, J., Pipher, J. and Silverman, J. H. 2008. An Introduction to Mathematical Cryptography. New York: Springer Science+Bussiness Media. 37-39.
Diffie, W. and Hellman, M. 1976. New Direction in Cryptography. IEEE Transaction on Information Technology. 22(6): 644-654.
Stallings, W. 2011. Cryptography and Network Security Principles and Practice. 5th Edition. New York: Prentice Hall: 35-36.
Verma, S. and Garg, D. 2011. Improvement in RSA Cryptosystem. Journal of Advanced in Information Technology. 2(3): 146-151
Boneh, D. and Shacham, H. 2002. Fast Variants of RSA. CryptoBytes. 5(1): 1-9
Boneh, D. and Durfee, G. 2000. Cryptanalysis of RSA with Private Key d Less Than N^0.292. IEEE Transaction Information Theory. 46(4): 1339-1349.
R. S. Kumar, R. S., Narasimam, C. and Setty, S. P. 2012. Generalization of Boneh-Durfee’s Attack for Arbitrary Public Exponent RSA. International Journal of Computer Applications. 49(19): 37-40.
Chang Ee Hung and Arif Mandangan.2013. Compression-RSA: New Approach of Encryption and Decryption Method. AIP Conference Proceeding 1522. American Institute of Physics. 50-54.
Arif Mandangan, Loh Chai Mei, Chang Ee Hung and Che Haziqah Che Hussin. 2013. Comression-RSA Technique: A More Efficient Ecryption-Decryption Procedure, AIP Conference Proceeding 1602. American Institute of Physics. 50-55.
Arif Mandangan, Loh Chai Mei, Chang Ee Hung and Che Haziqah Che Hussin. 2015. CFEA-Techique: Smaller Size of the Compressed Plaintext. Int. Journal of Cryptology Research. 5(1): 1-10.
Moore and Charles, D. 1964. An Introduction to Continued Fractions. Washington, D.C.: The National Council of Teachers of Mathematics.
Farouzan, B. A. 2008. Introduction to Cryptography and Network Security. New York: McGraw-Hill Companies: 301-311
Rivest, R. L., Shamir, A. and Adleman, L. 1978. A Method for Obtaining Digital Signature and Public Key Cryptosystem. Communication ACM. 21: 120-126.
ElGamal T. 1985. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm. IEEE Transactions on Information Theory. 31(4): 469-472.
Koblitz, N. 1987. Elliptic Curve Cryptosystem. Mathematics of Computation. 48(177): 203-209.
Downloads
Published
Issue
Section
License
Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.
