Call for Paper

CAE solicits original research papers for the July 2021 Edition. Last date of manuscript submission is June 30, 2021.

Read More

The Huffman’s Method of Secured Data Encoding and Error Correction using Residue Number System (RNS)

A. Alhassan, I.Saeed, P.A. Agbedemnab. Published in Information Sciences.

Communications on Applied Electronics
Year of Publication: 2015
Publisher: Foundation of Computer Science (FCS), NY, USA
Authors: A. Alhassan, I.Saeed, P.A. Agbedemnab
10.5120/cae2015651844

A Alhassan, I.Saeed and P A Agbedemnab. Article: The Huffman’s Method of Secured Data Encoding and Error Correction using Residue Number System (RNS). Communications on Applied Electronics 2(9):14-18, September 2015. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

@article{key:article,
	author = {A. Alhassan and I.Saeed and P.A. Agbedemnab},
	title = {Article: The Huffman’s Method of Secured Data Encoding and Error Correction using Residue Number System (RNS)},
	journal = {Communications on Applied Electronics},
	year = {2015},
	volume = {2},
	number = {9},
	pages = {14-18},
	month = {September},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}
}

Abstract

Over the centuries, information security has become a major issue. Encryption and decryption of data has recently been widely investigated and developed because there is a demand for a stronger encryption and decryption which is very hard for intrusion. Cryptography plays major roles in fulfilment of these demands. Many of researchers have proposed a lot of encryption and decryption algorithms. But most of the proposed algorithms encountered problems such as lack of reduced cost of data and error control mechanisms to maintain the security of data in the communication channel. In this paper, a highly secured data encryption and decryption scheme is proposed to enhance the Huffman’s method. The Residue Number System (RNS) is employed with four moduli set {2n-1, 2n─1, 2n+1, 2n+1─1} and two redundant moduli set {22n-3, 22n+1} for error handling using the concept of the traditional Huffman’s algorithm, where the frequency of occurrences of each character are used to generate binary codes. The proposed scheme allows for unreadable encrypted set of bits, except the intended recipient with the right moduli set can decrypt it, reduced cost of both data transmission and storage, and error detection and correction.

References

  1. Amamr A et al, 2001. A secured image coding scheme using Residue Number System. In: proceeding of the 18th national radio science conference, Egypt, pp 339-405.
  2. Omondi A and Premkuma B., 2007, Advances in Computer Science and Engineering: Texts – Vol. 2, Residue Number Systems Theory and Implementation. Imperial College Press 57 Shelton Street Covent Garden London WC2H 9HE, ISBN-13 978-1-86094-866-4.
  3. Weyori, B. A., et al, 2009. “Application of RNS to Huffman’s Method of Secured Data Encryption Algorithm”, International Journal of Soft Computing, 4(5):197-200, 2009, ISSN:1618-9503; Department of Computer Science, University for Development Studies, Navrongo, Ghana.
  4. Shannon, C. E., 1949. A Mathematical Theory of Communication. Bell Systems. Technical Journal. No. 27, PP: 379-423.
  5. Saravanan, C., and Surender, M.,2013. Enhancing Efficiency of Huffman Coding using Lempel Ziv Coding for Image Compression. International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-2, Issue-6, January 2013.
  6. Huffman, D. A., 1952. A method for the Construction of Minimum-redundancy Code. Proceedings of the Institute of Radio Engineers, 40(9): 1098-1101.
  7. Bankas, E. K., and Gbolagade, K. A., 2014. World Academy of Science, Engineering and Technology International Journal of Computer, Information, Systems and Control Engineering Vol:8 No:2, 2014.
  8. Gbolagade K. A., and Cotofana, S. D. 2009. Residue-to-Decimal Converters for Moduli Set with Common Factors, 52nd IEEE International Midwest Symposium on Circuits and Systems, pp 264-627.
  9. Yang, L. L., and Hanzo, L., 2001 “Redundant Residue Number System Based Error Correction Codes”, Vehicular Technology Conference, VTC 2001 Fall, pp 1472 -1476, vol.3, 2001.
  10. Szabo, N., and Tanaka, R., 1967. Residue Arithmetic and its Application to Computer Technology. MC-Graw-Hill. New York. 1967.
  11. Gallager, R. G., 1987. Variations on a Theme by Huffman. IEEE. Trans. Inform. Theory, I.T. 24(6): 668-674.
  12. Wang, Y., 2000. “Residue-to-Binary Converters Based on new Chinese Remainder Theorems”, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, pp197 -205, Vol.47, Issue 3, March 2000.
  13. Kulwar academic publisher (2002), “Residue Number Systems: Algorithms and Architecture.
  14. Ingels, F. M., 1971. Information and Coding Theory: Complete Edition, Intext, Scranton, Pennsylvania, USA, PP: 7-50. ISBN: 0631190724
  15. Connel, J. B., 1973. Huffman-Shannon-Fano Code. Proceedings of IEEE, 61(7): 1046-1047.
  16. Sun, J. D., and Krishna, H., 1992 “A Coding Theory Approach to Error Control in Redundant Residue Number System- Part II: Multiple Error Detection and Correction”, IEEE Trans. on Circuits and Systems, pp. vol. 39, 18–34.
  17. Fano, R. M., 1949. Transmission of Information (Complete Edition), M.I.T., Cambrige University Press. Cambrige, England, PP: 593-597. ISBN: 978-1-60558-183-5.
  18. Cappellini, V., 1989. Data Compression and Error Control Technique with Application. 3rd Edn. Academic press, London. Pp: 9-37. ISBN: 0-8194-2427-7.
  19. Goh, V. T., and Siddiqi, M. U., 2008. “Multiple Error Detection and Correction Based on Redundant Residue Number Systems”, IEEE Trans. On Communications, vol. 56, no. 3, pp. 325–330, March 2008.
  20. Mi Lu, 2004. “Arithmetic and Logic in Computer Systems”, John Wiley & Sons, Inc., Hoboken, New Jersey, 2004.

Keywords

Encryption, Decryption, Residue Number System (RNS), Redundant Moduli Set, Moduli Set, Huffman’s method, Data Security, Error Correction.