IJSTR

International Journal of Scientific & Technology Research

Home Contact Us
ARCHIVES
ISSN 2277-8616











 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

IJSTR >> Volume 8 - Issue 10, October 2019 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Strengthening The Vernam Cipher Algorithm Using Multilevel Encryption Techniques

[Full Text]

 

AUTHOR(S)

Deborah G. Brosas, Ariel M. Sison, Ruji P. Medina

 

KEYWORDS

Avalanche Effect, Cryptography, Multilevel Encryption, One Time Pad, Statistical Test, Stream Cipher, Vernam Cipher

 

ABSTRACT

Vernam Cipher, known as One Time Pad, was proved to be unbreakable; however, the keystream digits have to be completely random. Stream Ciphers address the issues by forgoing a degree of security by using a pseudorandom number generator, yet a known-plaintext attack is still a challenge when the key is used more than once due to a weak classical combiner XOR. With this, the study improved the algorithm using multilevel encryption techniques. The proposed algorithm evaluated with the use of Strict Avalanche Effect Criterion with average results of 81.48%. Moreover, the combined results of the Randomness Test having the P-Value between 0-1 (Table 4) indicates that the proposed method showed better results over the original Vernam Cipher algorithm.

 

REFERENCES

[1]. P. Penchalaiah and K. R. Reddy, “Random multiple key streams for encryption with added CBC mode of operation ଝ,” Perspect. Sci., vol. 8, pp. 57–60, 2016.
[2]. A. Saraswat, C. Khatri, P. Thakral, and P. Biswas, “An Extended Hybridization of Vigenere and Caesar Cipher Techniques for Secure Communication,” Procedia - Procedia Comput. Sci., vol. 92, pp. 355–360, 2016.
[3]. O. Salhab, N. Jweihan, M. A. B. U. Jodeh, and M. A. B. U. Taha, “SURVEY PAPER : PSEUDO RANDOM NUMBER,” vol. 96, no. 7, 2018.
[4]. E. Edition, E. Edition, O. Systems, S. Edition, B. D. Communications, and S. Edition, THE WILLIAM STALLINGS BOOKS ON COMPUTER DATA AND COMPUTER COMMUNICATIONS, EIGHTH EDITION...

[5]. B. K. Pawar, “Vernam Cipher : VSA,” 2016 Int. Conf. Inven. Comput. Technol.
[6]. A. Rahman Dalimunthe, H. Mawengkang, S. Suwilo, and A. Nazam, “Vernam Cipher with Complement Method and Optimization Key with Genetic Algorithm,” J. Phys. Conf. Ser., vol. 1235, p. 012030, 2019.
[7]. S. S. Kadhim, “Cryptography Using Modified Vernam - Homophonic Method Implemented by Matlab,” pp. 539–550, 2017.
[8]. Y. Heights, "Quantum Vernam cipher," vol. 1, no. 0, pp. 1–21, 2001.
[9]. J. Aumasson, Serious Cryptography. No Starch Press, Inc.
[10]. A. E. Omolara, A. Jantan, O. I. Abiodun, and H. Arshad, “An Enhanced Practical Difficulty of One-Time Pad Algorithm Resolving the Key Management and Distribution Problem,” vol. I, 2018.
[11]. G. Upadhyay and M. J. Nene, “One Time Pad Generation Using Quantum Superposition States,” no. 1, pp. 1882–1886, 2016.
[12]. M. Devipriya and G. Sasikala, “A New Technique for One Time Pad Security Scheme with Complement Method,” vol. 5, no. 6, pp. 220–223, 2015.
[13]. A. Omotunde and E. Onuiri, “An Implementation of a One-Time Pad Encryption Algorithm for Data Security in Cloud Computing Environment," no. December 2017.
[14]. P. Jattke, M. Senker, and A. Wiesmaier, “Comparison of two Lightweight Stream Ciphers :”
[15]. A. H. Kashmar, E. S. Ismail, F. M. Hamzah, and H. F. A. Amir, “Design a Secure Hybrid Stream Cipher,” vol. 5, no. 3, pp. 153–166, 2015.
[16]. S. J. Manowar and A. M. Sahu, “Introduction to Modern Encryption Standard ( MES ) -II : An independent and efficient Cryptographic approach for Data Security,” vol. 5, no. 1, pp. 310–313, 2014.
[17]. M. Lavanya, R. V. Sai, A. Festina, and J. Eshwari, “An Encryption Algorithm Functioning on ASCII Values and Random Number Generation,” vol. 8, no. December, pp. 8–11, 2015.
[18]. Y. Zhang, X. Liu, and M. Sun, “DNA based Random Key Generation Management for OTP Encryption,” BioSystems, 2017.
[19]. R. Divya and A. M. M, “The PolyVernam Cipher,” vol. 3, no. Viii, pp. 489–496, 2015.
[20]. T. H. E. P. House, O. F. The, and R. Academy, “Generation and testing of random numbers for cryptographic applications *,” vol. 13, no. 4, pp. 368–377, 2012.
[21]. M. Sýs, Z. Říha, V. Matyáš, K. Márton, and A. Suciu, “On the interpretation of results from the NIST statistical test suite,” Rom. J. Inf. Sci. Technol., vol. 18, no. 1, pp. 18–32, 2015.