Call for Paper - December 2020 Edition
IJCA solicits original research papers for the December 2020 Edition. Last date of manuscript submission is November 20, 2020. Read More

A New Algorithm for Key and Improved Feistel Rounds in Blowfish Algorithm

Print
PDF
IJCA Proceedings on National Conference on Knowledge, Innovation in Technology and Engineering (NCKITE 2015)
© 2015 by IJCA Journal
NCKITE 2015 - Number 1
Year of Publication: 2015
Authors:
Mahesh Patil
Rahul Kolhe

Mahesh Patil and Rahul Kolhe. Article: A New Algorithm for Key and Improved Feistel Rounds in Blowfish Algorithm. IJCA Proceedings on National Conference on Knowledge, Innovation in Technology and Engineering (NCKITE 2015) NCKITE 2015(1):5-8, July 2015. Full text available. BibTeX

@article{key:article,
	author = {Mahesh Patil and Rahul Kolhe},
	title = {Article: A New Algorithm for Key and Improved Feistel Rounds in Blowfish Algorithm},
	journal = {IJCA Proceedings on National Conference on Knowledge, Innovation in Technology and Engineering (NCKITE 2015)},
	year = {2015},
	volume = {NCKITE 2015},
	number = {1},
	pages = {5-8},
	month = {July},
	note = {Full text available}
}

Abstract

The main feature of Blowfish algorithm is its variable key size (ranges from 32 to 448 bit). The blowfish algorithm is 16 round feistel network and it uses large s-boxes which are key dependant. Blowfish algorithm use value of ? (=3. 14159…. ) to calculate the sub key values, but in cryptanalysis it is claimed that if attacker knows the value of hexadecimal digits of ? those we used for generation of sub keys, then it is easy for attacker to break key. In this paper random number generator (RNG) is introduced to create a set of values instead of ? value. Seed value is kept private so that no one can guess the value of sub keys and the random number generator (RNG) function is declared public. Also the 16 rounds of blowfish are replaced by 17 complex rounds of IDEA (International data encryption standard) to enhance the security. This paper focuses on enhancing security of Blowfish algorithm for digital content delivery.

References

  • S. Bruce, "Description of a new variable-length key, 64-bit block cipher (Blowfish),"In Fast Software Encryption Second International Workshop, Leuven, Belgium, December 1993, Proceedings, Springer-Verlag, ISBN: 3-540-58108-1, pp. 191-204, 1994.
  • M. Allam,"Data encryption performance based on Blowfish," 47th International Symposium ELMAR, Zadar, Croatia, 2005,pp. 131-134.
  • K. Russell Meyers, and H. Ahmed Desoky, "An implementation of the Blowfish cryptosystem," Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, Sarajevo, Bosnia and Herzegovina, pp. 346-351, December 16-19, 2008.
  • William Stallings, "Cryptography and Network Security", Third Edition, Pearson Education, 2003.
  • G. N. Krishnamurthy, Ramaswamy, V, M. E. Ashalatha, "Performance Enhancement of Blowfish and CAST-128 Algorithms and Security of Improved Blowfish Algorithms Using Avelanche Effect",International Journal of Computer Science and Network Security,Vol. 8 No. 3, 2008.
  • Bruce Schneier. The Blowfish Encryption Algorithm Retrieved October 25, 2008, http://www. schneier. com/blowfish. html
  • S. Vaudenay, "On the Weak Keys in Blowfish," Fast Software Encryption, Third International Workshop Proceedings, Springer-Verlag, 1996, pp. 27-32.