Open Access Open Access  Restricted Access Subscription Access

Enhancement of Strassen’s Matrix Using Scilab

Saloni Jain

Abstract


The paper “Enhancement of Strassen’s Matrix Multiplication” is divided into two phases. 1st phase aims at providing ease in the calculations done in ordinary matrix multiplication and using encryption and decryption techniques which enhances security measures. This paper encourages the people to perform less complex calculations. T(n)=7T(n/2)+O(n^2), nlogba=nlog 27==n^2.81, Master’s method T(n)=O(nlog7). The number 2.81 may not seem much smaller than 3, but because the difference is in exponent, the impact on running time is significant. In fact, Strassen’s algorithm beats the ordinary algorithm on today’s machines for n>=3 and so on. 2nd phase: Using complicated algorithms though is suited for encryption to avoid insecurity of sensitive and crucial data, but at the same time it is much complex process and costly too. In today’s world, everyday thousands of people interact electronically, whether it is through emails or e-commerce, etc. over the network. Exchanging sensitive and personal data over the internet or any other network can be very risky and dangerous so we need to encrypt it and then send it over the network. Thus various efficient encryption and decryption techniques are elaborated in this paper.

Cite this Article
Saloni Jain. Enhancement of Strassen’s Matrix Using Scilab. Research & Reviews: Discrete Mathematical Structures. 2016; 3(1): 27–34p.


Keywords


Scilab, Encryption, Decryption, Strassen’s Matrix

Full Text:

PDF

References


Available at: www.scilab.org

Available at: www.scilab.in 3. Campbell S, Changelier J, Nikoukhan R. Modeling and Simulation in Scilabl/Scicos, Spinger-Verlag, 2006.

David S. Watkins. Fundamentals of Matrix Computations. Wiley, Second edition, 2002.

Neeraj Sharma. A Comparative Study of Several Numerical Computational Packages. [M.S. thesis], University of Maryland, Baltimore County, 2010.

Neeraj Sharma, Matthias K. Gobbert. Performance Studies for Multithreading in Matlab with Usage Instructions on hpc. Technical Report HPCF–2009–1, UMBC High Performance Computing Facility, University of Maryland, Baltimore County, 2009. 7. Goldwasser S, Bellare M. Lecture Notes on Cryptography [online] Available at: http://www-cse.ucsd.edu/users/mihir/papers/gb.html. 8. Merkle RC, Brassard G. A Certified Digital Signature, CRYPTO89, 1990; 435: 218–238p.

National Bureau of Standards, Data Encryption Standard, FIPS Publication 46, 1977.

Daemen J, Rijmen V. Rijndael: The Advanced Encryption Standard. Dr. Dobb's J. March 2001; 26(3): 137–139p.

Ramesh G, Umarani R. Data Security in Local Area Network Based on Fast Encryption Algorithm, Int J Comp Commun Info Syst (JCCIS). 2010; 89: 85–90p.

Diaa Salama Abdul Minaam, Hatem M. Abdual-Kader, Mohiy Mohamed Hadhoud. Evaluating the Effects of Symmetric Cryptography Algorithms on Power Consumption for Different Data Types. Int J Netw Security. Sept 2010; 11(2): 78–87p.

Simar Preet Singh, Raman Maini. Comparison of Data Encryption Algorithms. Int J Comp Sci Commun. January-June 2011; 2(1): 125–127p.


Refbacks

  • There are currently no refbacks.


This site has been shifted to https://stmcomputers.stmjournals.com/