AN IMPROVED SYMMETRIC CIPHER ENCRYPTION FOR SECURING DATA

Full Article - PDF

Published: 2015-05-26

Page: 139-154


PETER NIMBE *

Department of Computer Science, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana.

J. B. HAYFRON-ACQUAH

Department of Computer Science, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana

BENJAMIN A. WEYORI

Department of Computer Science and Informatics, University of Energy and Natural Resources, Sunyani, Ghana.

*Author to whom correspondence should be addressed.


Abstract

This paper presents an innovative algorithm for a symmetric cipher named, “NC1” that employs positive integers as private key-spaces of varying lengths to encrypt and decrypt data or information. “NC1” elegantly employs the Binomial Theorem, Pascal Triangle, Modular and Basic Arithmetic and some concepts of the Substitution ciphers. Depending on observations of the results of implementation of the proposed symmetric cipher on a set of real data of several types, all results are registered and analyzed. Some of the existing or traditional ways of protecting networks with ciphers or cryptosystems are no longer effective and could be easily broken [1]. This symmetric cipher is quite non-susceptible to cryptanalysis intrusions considering its large key-space and the strength of the underlying cipher. Evaluation of key mechanisms, concepts and principles in this cipher is highlighted and its implementation and applicability shown to demonstrate its importance.

Keywords: Cryptography, cipher, symmetric cipher, asymmetric cipher, monoalphabetic cipher, polyalphabetic cipher, multiple letter cipher, caesar cipher, hill cipher, playfair cipher, blowfish cipher, rijndael cipher


How to Cite

NIMBE, P., HAYFRON-ACQUAH, J. B., & WEYORI, B. A. (2015). AN IMPROVED SYMMETRIC CIPHER ENCRYPTION FOR SECURING DATA. Asian Journal of Mathematics and Computer Research, 4(3), 139–154. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/81

Downloads

Download data is not yet available.