A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sai Prasanthi, K.
- Particular Case of Blowfish Algorithm
Authors
1 Department of Computer Science and Engineering, GIET, Gunupur, Odisha, IN
2 Engineering Department, Visakha Container Terminal, Visakhapatnam, IN
Source
Networking and Communication Engineering, Vol 4, No 7 (2012), Pagination: 421-426Abstract
Encryption algorithm plays a crucial role in information security which guarantees the recent growing internet and network applications. They are used to secure the data in wireless networks against malicious attacks but securing data also consumes resources such as C.P.U time, Memory, battery power, encryption time etc. Blowfish, a new secret-key block cipher, is proposed. It is a Feistel network, iterating a simple encryption function 16 times. The block size is 64 bits, and the key can be any length up to 448 bits. Although there is a complex initialization phase required before any encryption can take place, the actual encryption of data is very efficient on large microprocessors. This paper discusses the requirements for a standard encryption algorithm. Experimental results show that Blowfish encryption algorithm may be more suitable for wireless networks with secure data transmission. With reduced bits in plain text and key our aim is to make it useful for systems having minimum configuration.
Keywords
Block Cipher, Fiestel Network, Standard Encryption.- New Encryption Standard and Particular Case of GOST Algorithm
Authors
1 Department of Computer Science and Engineering, GIET, Gunupur, Odisha, IN
2 Department of Computer Science and Engineering, GIET, Gunupur, Odisha, IN
3 Engineering Department, Visakha Container Terminal, Visakhapatnam, IN
Source
Networking and Communication Engineering, Vol 4, No 4 (2012), Pagination: 243-247Abstract
GOST is a well-known 256-bit block cipher which is a plausible alternative for AES-256 and triple DES. In 2010 GOST was submitted to ISO 18033, to become a worldwide industrial encryption standard. Until 2011 researchers unanimously agreed that GOST could or should be very secure, which was summarized in 2010 in these words: ―despite considerable cryptanalytic efforts spent in the past 20 years, GOST is still not broken". Unhappily, it was recently discovered that GOST can be broken and is a deeply flawed cipher. Looking at the current situation, our ambition is to tighten up the security factor that minimizes the effect of Cryptanalysis being done on GOST algorithm. Our new paradigm is having substantial amount of effort and an improvable aspect on security over the network. GOST is a block cipher algorithm proposed for the security of data or information when transmitted over the network. This algorithm practices some techniques for secure communication in the presence of adversaries. It is related to various aspects in information security such as data confidentiality, data integrity and authentication. Making GOST algorithm much simpler and little more secure by removing the key repetition, the algorithm shows good resistance against the brute force attack.