New random block cipher algorithm

Abstract

This paper proposed a new secret key random block cipher as a candidate for Reaction Automata Direct Graph (RADG method). A new secret key consists of a 64-bit block size and a 128-bit key length. A new algorithm based in design on Generalized Unbalanced Feistel Network and uses a new S-boxes generated from a DES S-boxes, a bijective F function, bitwise operations and a carefully key schedule design. The new algorithm uses in protected wireless network and comparing with the old system (without encryption key), the proposed designs are designed for security purposes as characterized highly efficient encrypting large data. As for the analysis for the proposed block cipher design proves terms of privacy, data integrity, authentication and non-repudiation.