Skip to main content
SpringerLink
Log in

A Parallel Algorithm for determining the inverse of a matrix for use in blockcipher encryption/decryption

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In the current world that we live in, of rapid growing technology, and especially reliance on the Internet for our daily lively hood (Banking, shopping, entertainment, news), and also with current crimes (Identity-theft, hacking, spyware), computer security is becoming more and more important. By “computer security” we often refer to addressing three important aspects of a computer-related system: Confidentiality, integrity, and availability. Encryption clearly addresses the need for confidentiality of data, both in storage and transmission. However, the use of encryption can be cumbersome and time consuming. It is important to have a fast algorithm to both encrypt and decrypt data as needed. Public key encryption, though secure, is definitely not fast enough to be used for large size data.

We introduce a Parallel Algorithm for computation of inverses of matrices modulo n. This is used in conjunction with Block Ciphers and Hill Ciphers in symmetric encryption and decryption of data for transmission on open lines. Experimental studies were done to compare the run-time of this algorithm on parallel machines, to the traditional one. The new algorithm was found to perform much better than the traditional one, and would be useful to use in encryption/decryption of large sensitive data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Pfleeger CP, Pfleeger SL (2003) Security in computing, 3rd edn. Prentice Hall

  2. Diffie W, Hellman M (1976) New directions in cryptography. IEEE Trans Inf Theory 22: 644–654

    Article  MATH  MathSciNet  Google Scholar 

  3. Stallings W (2003) Cryptography and network security. Prentice Hall

  4. Rivest RL, Shamir A, Adleman LM (1978) A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2):120–126. See also U.S. Patent 4,405,829

    Article  MATH  MathSciNet  Google Scholar 

  5. Merkle R, Hellman M (1978) Hiding information and signatures in Trapdoor Knapsacks. IEEE Trans Inf Theory IT-24(5):525–530

    Article  Google Scholar 

  6. El Gamal A (1985) A public key cryptosystem and signature scheme based on discrete logarithms. IEEE Trans Inf Theory IT-31(4):469–472

    Article  MathSciNet  Google Scholar 

  7. Feistal H (1973) Cryptograpy and computer privacy. Sci Am

  8. Shannon C (1949) Communication theory of secrecy systems. Bell Syst Tech J (4)

  9. National Bureau of Standards (1977) Data Encryption Standard, FIPS-Pub.46. National Bureau of Standards, U.S. Department of Commerce, Washington, January 1977

  10. Ehrsam et al (1975) Product block cipher system for data security, Patent 3,962,539, Filed Feb. 24, 1975

  11. Ferguson N, Kelsey J, Lucks S, Schneier B, Stay M, Wagner D, Whiting D (2000) Improved Cryptanalysis of Rijndael, Fast Software Encryption, pp 213–230

  12. Daemen J, Govaerts R, Vandewalle J (1994) A new approach to block cipher design. Fast Software Encryption, Lecture notes in computer science, vol 809, pp 18–32

  13. Eisenberg M (1998) Hill ciphers and modular linear algebra. Mimeographed notes, University of Massachusetts

  14. Weiner MJ (1996) Efficient DES Search Key, Technical Report TR-244, Carleton University. In: Stallings W (ed) Practical cryptography for data internetworks. IEEE Computer Society Press

  15. Daemen J, Rijmen V (2001) The design of rijndael. Springer

  16. Hill LS (1929) Cryptography in an algebraic alphabet. Am Math Mon 36:306–312

    Article  Google Scholar 

  17. Anton H, Rorres C (1991) Elementary linear algebra: applications version, 6 edn. Wiley, New York. See Sect. 11.17

    Google Scholar 

  18. Cormen T, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. The MIT Press, McGraw-Hill Book Company

  19. Buzbee BL (1983) The efficiency of parallel processing. Frontiers of Supercomputing, Los Alamost Sci, p. 71, Fall (Also available at http://fas.org/sgp/othergov/doe/lanl/pubs/00326992.pdf)

  20. Ahmdal GM (1967) Validity of the single-processor approach to achieving large scale computing capabilities. In: AFIPS conference proceedings, vol 30, Atlantic City, April 18–20. AFIPS Press, Reston, pp 483–485

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Sciences, University of Guelph, Guelph, Ontario, Canada

    Charlie Obimbo & Behzad Salami

Authors
  1. Charlie Obimbo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Behzad Salami
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Charlie Obimbo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Obimbo, C., Salami, B. A Parallel Algorithm for determining the inverse of a matrix for use in blockcipher encryption/decryption. J Supercomput 39, 113–130 (2007). https://doi.org/10.1007/s11227-007-0107-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-007-0107-7

Keywords

Search

Navigation