Advertisement

A Symmetrical Encryption Technique for Text Encryption Using Randomized Matrix Based Key Generation

  • Pratik Gajanan ManteEmail author
  • Harsh Rajendra Oswal
  • Debabrata Swain
  • Deepali Deshpande
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 37)

Abstract

At present huge amount of data are moving through internet, this creates a huge concern for the security of the data while it is being moved through unsecured medium like wireless internet. Among all data most commonly used data format is text data which even though being highly vulnerable to security breaches is used in essential areas like banking and database management. There are many methodologies proposed to secure this data but the possibility of data being exploited remains. The proposed system presents a new symmetric encryption technique where complexities of calculating determinants and developing random matrices are used to generate keys. The system consists of three phases, key generation, encryption and decryption. In the first phase keys are generated which are computed by calculating the determinants of decomposed matrices, these decomposed matrices are generated from the multiplication of the original random matrices. In the second phase a key is randomly selected and is added with the ASCII value of the text message. The new generated value is then multiplied with the multiplication factor which is decomposition of selected key into the range of zero to nine. In the last phase the encrypted text is reverted back to its original text by performing reverse operations performed during encryption phase i.e. division of ASCII value of encrypted text by multiplication factor and then subtraction of the value of key from the computed result. The performance of the system is measured by calculating the total time taken to generate key with encryption and decryption of the input text message. The proposed system has been compared with various existing robust systems like AES, DES and BLOWFISH. And from the comparison it can be asserted that the proposed system is more efficient than the existing systems.

Keywords

BCD coded parity based encryption technique RBCMCPCC AIDEA LEA Determinant Matrix multiplication 

References

  1. 1.
    H. El-Hennaway, A.E.A Omar, S. Kholaif, LEA: link encryption algorithm proposed stream cipher algorithm. Ain Shams Eng. J. (2014)Google Scholar
  2. 2.
    B. Wang, Q. Wu, Y. Hu, A knapsack based probabilistic encryption scheme. On Line March (2007)Google Scholar
  3. 3.
    Performance analysis of encryption algorithms for information security, in International Conference on Circuits, Power and Computing Technologies (ICCPCT-2013) (2013)Google Scholar
  4. 4.
    evaluation of symmetric encryption algorithms for MANETs, in IEEE International Conference on Computational Intelligence and Computing Research (ICCIC) (2010)Google Scholar
  5. 5.
    The application of hybrid encryption algorithm in software security, in Fourth International Conference on Computational Intelligence and Communication Networks (CICN) (2012)Google Scholar
  6. 6.
    Efficient key management and cipher text generation using BCD coded parity bits, in 3rd International Conference on Recent Trends in Computing (ICRTC) (2015)Google Scholar
  7. 7.
    Performance evaluation of cryptographic algorithms: DES and AES, in IEEE Students’ Conference on Electrical, Electronics Computer ScienceGoogle Scholar
  8. 8.
    J.A. Davis. D.B. Holdridge. G.J. Simmons, Status report on factoring, in Proceedirigy of EurocrXpr ’84 (Lecture Notes in Computer Science 209) (Springer, Berlin, West Gcrmany, 1985Google Scholar
  9. 9.
    J. Supercunipur, T.R. Caron, R.D. Silverinan, Parallel implementation of the quadratic sieve. to be publishedGoogle Scholar
  10. 10.
    R. Berger, S. Kannan, R. Peralta, A framework for the study of cryptographic protocols, in Proceedings of Crypro ’85 (Lecture Notes in Computer Science 218) (Springer, Berlin, Germany, 1985), pp. 87–103Google Scholar
  11. 11.
    Fast evaluation of logarithms in finite fields with characteristic two, in IEEE Trtiris Theory, vol. IT-30 (1984)Google Scholar
  12. 12.
    G. Singh, A study of encryption algorithms (RSA, DES, 3DES and AES) for information security. Int. J. Comput. Appl. (2013)Google Scholar
  13. 13.
    The data encryption standard (DES) and its strength against attacks. IBM J. Res. Dev. (1994). CoppersmithGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Pratik Gajanan Mante
    • 1
    Email author
  • Harsh Rajendra Oswal
    • 1
  • Debabrata Swain
    • 2
  • Deepali Deshpande
    • 2
  1. 1.Computer Engineering DepartmentVishwakarma Institute of TechnologyPuneIndia
  2. 2.Information Technology DepartmentVishwakarma Institute of TechnologyPuneIndia

Personalised recommendations