Secure encryption over the ring F2 + uF2 + vF2 + uvF2

Abstract

Cryptology is a part of mathematics as encryption and decryption. The purpose of encryption is to make information incomprehensible when it is in the hands of unauthorized people. The receiver can decrypt the message that encrypted by the sender with helping of the key. The important point is that the key cannot be decrypted by other people. One Time Pad method solves this problem. The key is used only once each encryption in this method. So, the key becomes harder to guess. If the key is solved by unauthorized people, the message cannot be solved. Because of with each decryption, many meaningful messages are obtained. Every cyclic shift in a cyclic code constructs a new key and in each encryption is used the new key. Many keys are generated thanks to cyclic codes. In this paper, we improve the new encryption scheme by using the cyclic codes with One Time Pad method.

Keywords

• One Time Pad Method
• Cyclic Code
• Ring

References

1. REFERENCES
2. [1] Vernam G. S. Cipher printing telegraph systems for secret wire and radio telegraphic communications. Trans J Am Inst Electr Eng 1926;45:295301. [CrossRef]
3. [2] Kuklová Z. Coding theory, cryptography and cryptographic protocols-exercises with solutions. Bachelor Thesis, Masaryk University, Brno, Faculty of Informatics; 2007.
4. [3] Çalkavur S. Güzeltepe M. Secure encryption from cyclic codes. Sigma J Eng Nat Sci 2022;40:380389. [CrossRef]
5. [4] Yildiz B. Karadeniz S. Cyclic codes over . Des Codes Cryptogr 2011;58:221234. [CrossRef]
6. [5] Dertli A. Halkalar Üzerinde Tanımlı Kodlar Hakkında Bazı Araştırmalar [master thesis]. Samsun: Ondokuz Mayıs University; 2016.
7. [6] Ling S. Xing C. Coding Theory: A First Course. Cambridge University Press. 2004. [CrossRef]
8. [7] Hill R. A First Course in Coding Theory. Oxford: Oxford University; 1990.

9. [8] Petrenko V. Ryabtsev S. Pavlov A. Apurin A. Development of an Encryption Method Based on Cyclic Codes, 21st International Workshop on Computer Science and Information Technologies. pp.196-201, Atlantis Press. 2019. [CrossRef]
10. [9] Aguilar-Melchor C. Blazy O. Deneuville J. C. Gaborit P. Zémor G. Efficient encryption from random quasi-cyclic codes. IEEE Trans Inform Theor 2018;64:39273943. [CrossRef]
11. [10] Prange E. The use of information sets in decoding cyclic codes. IRE Trans Inform Theor 1962;8:5–9. [CrossRef]
12. [11] Abualrub T. Seneviratne P. Skew codes over ring. Proceedings of the International MultiConference of Engineers and Computers Sciences 2010 Vol. II, IMECS, , Hong Kong, March 17-19, 2010
13. [12] Srikantaswamy SG, Phaneendra HD. Enhanced onetime pad cipher with morearithmetic and logical operations with flexible key generation algorithm. Int J Netw Secur Appl 2011;6:3. [CrossRef]
14. [13] Hussein MN, Megahed MH, Abdel Azeem MH. Design and simulation of authenticated encryption AENOTP stream cipher algorithm, 13th International Computer Engineering Conference. 2017. p. 393398. [CrossRef]
15. [14] Patil S. Devare M. Kumar A. Modified one time pad data security scheme :Random key generation approach. Int J Comput Sci Secur 2014;3:139145.
16. [15] Ma F. Gao J. Bounds on Covering Radius of Some Codes Over . IEEE 2021;9:4766847676, 2021. [CrossRef]
17. [16] Shannon C. Communication theory of secrecy systems. Bell Syst Tech J 1949;28:656–715. [CrossRef]