ICTACT Journal on Communication Technology

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

WSES: High Secured Data Encryption and Authentication Using Weaving, Rotation and Flipping


Affiliations
1 Department of Computer Science, S.T. Hindu College, India
     

   Subscribe/Renew Journal


Data security is the very important part in the network data communication. Avoidance of the information hacking and steeling are very challenging part for network data communication. Now-a-days people are using many encryption and decryption techniques for data security. But all encryption and decryption techniques are having more time occupation or less security for the process. This paper proposed high level security approach to encryption and decryption for data security. Two levels of securities are used in this proposed method. First one is data encryption and the second one is hash value generation. The proposed Weaving based Superior Encryption Standard (WSES) uses a novel weaving based approach. The weaving array generation is done by Elementary Number Theory Notation (ENTN) method. The weaving array has multiple private keys for XOR encryption. After encryption the error value is extracted from the encrypted array and weaving array. This error value is sent to the other side. The novel approach for hash value generation uses the encrypted array. After encryption, the encrypted array is rotated into four degrees and each degree data are converted to vector format and arranged on by one under the vector. Finally a 2D Rotational Encryption Matrix (REM) is obtained. After this process a REM copy is converted to mirror flip and it is need as Flipped Matrix (FM). The FM is concatenated under the REM and converted to vector using the zigzag operation. Finally this process gives two bytes hash value from the vector. This proposed method executes very fast and provide high security. This method is much reliable to small size applications and also used for any type of data security.

Keywords

Data Security, XOR, WSES, Encryption, Decryption, Hash, ENTN, Weaving, REM, Flipped Matrix.
Subscription Login to verify subscription
User
Notifications
Font Size

  • G.R. Blakley, “Safeguarding Cryptographic Keys”, Proceedings of the AFIPS National Computer Conference, pp. 313-317, 1979.

  • Adi Shamir, “How to Share a Secret”, Communications of the ACM, Vol. 22, No. 11, pp. 612-613, 1979.

  • Amit Sahai and Brent Waters, “Fuzzy Identity-based Encryption”, Proceedings of 24th Annual International Conference on Theory and Applications of Cryptographic Techniques, pp. 457-473, 2005.

  • Vipul Goyal, Omkant Pandey, Amit Sahai and Brent Waters, “Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data”, Proceedings of the 13th ACM conference on Computer and Communications Security, pp. 89-98, 2006.

  • Chih-Ching Thien and Ja-Chen Lin, “Secret Image Sharing”, Computers & Graphics, Vol. 26, No. 5, pp. 765-770, 2002.

  • Chih-Ching Thien and Ja-Chen Lin, “An Image-Sharing Method with User-Friendly Shadow Images”, IEEE Transactions on Circuits and Systems for Video Technology, Vol. 13, No. 12, pp. 1161-1169, 2003.

  • Sian-Jheng Lin and Ja-Chen Lin, “VCPSS: A Two-in-One Two-Decoding Options Image Sharing Method Combining Visual Cryptography (VC) and Polynomial-Style Sharing (PSS) Approaches”, Pattern Recognition, Vol. 40, No. 12, pp. 3652-3666, 2007.

  • Peng Li, Pei-Jun Ma, Xiao-Hong Su and Ching-Nung Yang, “Improvements of a Two-in-One Image Secret Sharing Scheme based on Gray Mixing Model”, Journal of Visual Communication and Image Representation, Vol. 23, No. 3, pp. 441-453, 2012.

  • O. Goldreich, “Foundations of Cryptography: Volume 2, Basic Applications”, First Edition, Cambridge University Press, 2004.

  • R. Rivest, A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Communications of the ACM, Vol. 21, No. 2, pp. 120-126, 1978.

  • Z. Stanisavljevic, V. Pavlovic, B. Nikolic and J. Djordjevic, “SDLDS-System for Digital Logic Design and Simulation”, IEEE Transactions on Education, Vol. 56, No. 2, pp. 235-245, 2013.

  • Guido Roßling, Markus Schuer and Markus Schuer, “The ANIMAL Algorithm Animation Tool”, Proceedings of the 5th Annual SIGCSE/SIGCUE ITiCSE Conference on Innovation and Technology in Computer Science Education, Vol. 32, No. 3, pp. 37-40, 2000.

  • Abbasi-Moghadam, V.T. Vakili, and A. Falahati, “Combination of Turbo Coding and Cryptography in Non-Geo Satellite Communication Systems”, Proceedings of International Symposium on Telecommunications, pp. 666-670, 2008

  • Bin Liu and Bevan M. Baas, “Parallel AES Encryption Engines for Many Core Processor Arrays”, IEEE Transactions on Computers, Vol. 62, No. 3, pp. 536-547, 2013.

  • Ming Li, Shucheng Yu, Yao Zheng, Kui Ren and Wenjing Lou, “Scalable and Secure Sharing of Personal Health Records in Cloud Computing Using Attribute-Based Encryption”, IEEE Transactions on Parallel And Distributed Systems, Vol. 24, No. 1, pp. 131-143, 2013.

  • Liberty Alliance, Available at http:// projectliberty.org/.

  • Guido Bertoni, Joan Daemen, Michael Peeters and Gilles Van Assche, “Sponge Based Pseudo Random Number Generators”, Proceedings of the 12th International Conference on Cryptographic Hardware and Embedded Systems, pp. 33-47, 2010.

  • National Institute of Standards and Technology, “Announcing Request for Candidate Algorithm Nominations for a New Cryptographic Hash Algorithm (SHA-3) Family”, Federal Register, Vol. 72, pp. 62212-62220, 2007.

  • Andrew Regenscheid, Ray Perlner, Shu-jen Chang, John Kelsey, Mridul Nandi and Souradyuti Paul, “Status Report on the 1st Round of the SHA-3 Cryptographic Hash Algorithm Competition”, NISTR 7620, Information Technology Laboratory, National Institute of Standards and Technology 2009.

  • Andrey Bogdanov, G. Leander, C. Paar, A. Poschmann, M.J.B. Robshaw and Y. Seurin, “Hash Functions and RFID Tags: Mind the Gap”, Proceeding of 10th International Workshop Cryptographic Hardware and Embedded Systems, pp. 283-299, 2008.

  • Jean-Philippe Aumasson, Luca Henzen, Willi Meier and María Naya-Plasencia, “Quark: A Lightweight Hash”, Journal of Cryptology, Vol. 26, No. 2, pp. 313-339, 2010.

  • Guido Bertoni, Joan Daemen, Michael Peeters and Gilles Van Assche, “On the Indifferentiability of the Sponge Construction”, Proceedings of the 27th Annual International Conference on Theory and Applications of Cryptographic Techniques, pp. 181-197, 2008.

  • G. Bertoni, J. Daemen, M. Peeters and G. Van Assche, “Sponge Functions”, Proceedings of Ecrypt Hash Workshop, 2007.

  • C.J. Ezeofor and A.G. Ulasi, “Analysis of Network Data Encryption & Decryption Techniques in Communication Systems” International Journal of Innovative Research in Science, Engineering and Technology, Vol. 3, No. 12, pp. 17797-17807, 2014.


Abstract Views: 353

PDF Views: 0




  • WSES: High Secured Data Encryption and Authentication Using Weaving, Rotation and Flipping

Abstract Views: 353  |  PDF Views: 0

Authors

A. Yesu Raja
Department of Computer Science, S.T. Hindu College, India
S. Arumuga Perumal
Department of Computer Science, S.T. Hindu College, India

Abstract


Data security is the very important part in the network data communication. Avoidance of the information hacking and steeling are very challenging part for network data communication. Now-a-days people are using many encryption and decryption techniques for data security. But all encryption and decryption techniques are having more time occupation or less security for the process. This paper proposed high level security approach to encryption and decryption for data security. Two levels of securities are used in this proposed method. First one is data encryption and the second one is hash value generation. The proposed Weaving based Superior Encryption Standard (WSES) uses a novel weaving based approach. The weaving array generation is done by Elementary Number Theory Notation (ENTN) method. The weaving array has multiple private keys for XOR encryption. After encryption the error value is extracted from the encrypted array and weaving array. This error value is sent to the other side. The novel approach for hash value generation uses the encrypted array. After encryption, the encrypted array is rotated into four degrees and each degree data are converted to vector format and arranged on by one under the vector. Finally a 2D Rotational Encryption Matrix (REM) is obtained. After this process a REM copy is converted to mirror flip and it is need as Flipped Matrix (FM). The FM is concatenated under the REM and converted to vector using the zigzag operation. Finally this process gives two bytes hash value from the vector. This proposed method executes very fast and provide high security. This method is much reliable to small size applications and also used for any type of data security.

Keywords


Data Security, XOR, WSES, Encryption, Decryption, Hash, ENTN, Weaving, REM, Flipped Matrix.

References