Fast and robust approach for data security in communication channel using pascal matrix

Oday Kamil Hamid, Riyadh Bassil Abduljabbar, Nazar Jabbar Alhyani

Abstract


This paper present the fast and robust approach of English text encryption and decryption based on Pascal matrix. The technique of encryption the Arabic or English text or both and show the result when apply this method on plain text (original message) and how will form the intelligible plain text to be unintelligible plain text in order to secure information from unauthorized access and from steel information, an encryption scheme usually uses a pseudo-random enecryption key generated by an algorithm. All this done by using Pascal matrix. Encryption and decryption are done by using MATLAB as programming language and notepad ++to write the input text.This paper present the fast and robust approach of English text encryption and decryption based on Pascal matrix. The technique of encryption the Arabic or English text or both and show the result when apply this method on plain text (original message) and how will form the intelligible plain text to be unintelligible plain text in order to secure information from unauthorized access and from steel information, an encryption scheme usually uses a pseudo-random encryption key generated by an algorithm. All this done by using Pascal matrix. Encryption and decryption are done by using MATLAB as programming language and notepad ++to write the input text.

Keywords


English, Encryption, Decryption, Pascal matrix

References


Frustaci, M.; Pace, P.; Aloi, G.; Fortino, G. Evaluating Critical Security Issues of the IoT World: Present andFuture Challenges. IEEE Internet Things J. 2018, 5, 2483–2495

Kai M., Philipp K., Stefan W., ‘How Usable are Rust Cryptography APIs? ,IEEE, 2018, pp. 143–154, 2018, doi: 10.1109/QRS.2018.00028

Kurosawa, K. ‘Kurosawa-Desmedt key encapsulation mechanism, revisited’, International Conference on Cryptology in Africa, Springer International Publishing, pp.51–68.2014.

Kiayias, A., Zacharias, T. and Zhang, B. ‘End-to-end verifiable elections in the standard model’, Annual InternationalConference on the Theory and Applications of CryptographicTechniques, Springer Berlin Heidelberg, pp.468–498.2015

Chen, C.M., Wang, K.H., Wu, T.Y., Pan, J.S., Sun, H.M.: A scalable transitive human-verifiable authentication protocol for mobile devices. Information Forensics and Security, IEEE Transactions on 8(8), 1318–1330 (2013).

Forte, A.G., Garay, J.A., Jim, T., Vahlis, Y.: Eyedecrypt—private interactions in plain sight. In: International Conference on Security and Cryptography for Networks. pp. 255–276. Springer (2014).

Lateiner, D. “Signifying Names and Other Ominous Accidental Utterances in Classical Historiography,” Greek, Roman, and Byzantine Studies 45.1 (2010): 35–57. Print.

Goodrich, M.T., Sirivianos, M., Solis, J., Tsudik, G., Uzun, E.: Loud and clear: Human-verifiable authentication based on audio. In: Distributed Computing Systems, 2006. ICDCS 2006. 26th IEEE International Conference on. pp. 10–10. IEEE (2006)

Chow, Y.W., Susilo, W., Au, M.H., Barmawi, A.M.: A visual one-time password authentication scheme using mobile devices. In: International Conference on Infor-mation and Communications Security. pp. 243–257. Springer (2014).

A. Kanso, H. Yahyaoui, and M. Almulla, "Keyed hash function basedon a chaotic map," Information Sciences, vol. 186, no. 1, pp. 249-264, 2012. doi:10.1016/j.ins.2011.09.008.

M. Y. Valandar, P. Ayubi, and M. J. Barani, "A new transform domain steganography based on modified logistic chaotic map for color images," Journal of Information Security and Applications, vol. 34, pp. 142-151, Jun. 2017. doi:10.1016/j.jisa.2017.04.004

Chen, C.L., Chen, Y.Y., Jan, J.K. and Chen, C.C. ‘Asecure anonymous e-voting system based on discrete logarithm problem’, Applied Mathematics and Information Sciences,Vol. 8, No. 5, pp.2571–2578.2014

Y. Acar et al. “Comparing the Usability of Cryptographic APIs”. In: 2017 IEEE Symposium on Security and Privacy (SP) . May 2017, pp. 154–171. DOI : 10 . 1109/SP.2017.52

Neji, W., Blibech, K. and Ben Rajeb, N. ‘Distributed key generation protocol with a new complaint management strategy’, Security and Communication Networks, Vol. 9,No. 17, pp.4585–4595.2016.

A. Beimel, "Secret-Sharing Schemes: A Survey," in Coding and Cryptology, 2011, pp. 11-46. doi:10.1007/978-3-642-20901-7_2

Lee, B., Boyd, C., Dawson, E., Kim, K., Yang, J. and Yoo,S. (2003) ‘Providing receipt-freeness in mixnet-based voting protocols’, International Conference on Information Security

and Cryptology, Springer Berlin Heidelberg, pp.245–258.

Riyadh B. “Fast Approach for Arabic Text Encryption using Genetic Algorithm”, European Journal of Scientific Research, Volume 144 , Issue 4, pp. 342-348, 2017.

Riyadh B. “steganography System using Slantlet” , Journal of Information, Communication, and Intelligence Systems (JICIS) Volume 2 , Issue 1, February 2016.

Seddeq E. , Haneen A. et al,’ New Text Encryption Method Based on Hidden Encrypted

Symmetric Key.’, ACIT 2018, June 1-3, 2018, Ceske Budejovice, Czech Republic.

Wafa, N., Kaouther, B., Narjes, B ,.“A secure electronic voting protocol with a simple ballot’s encryption function,”. Int. J. Security and Networks, Vol. 13, No. 1, 2018.

Usman, M., Ahmed, I.,et al,’ A Light weight Encryption Algorithm for Secure Internet of Things’. Int. J. Adv. Comput. Sci. Appl. 2017, 8.

Rachmawati, D.; Sharif, A.; Jaysilen; Budiman, M.A. ‘Hybrid Cryptosystem Using Tiny Encryption Algorithm and LUC Algorithm’. IOP Conf. Ser. Mater. Sci. Eng. 2018, 300, 012042.




DOI: http://doi.org/10.11591/ijeecs.v19.i1.pp%25p
Total views : 9 times

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

shopify stats IJEECS visitor statistics