PATFC: novel pseudorandom affine transformation-Based Feistel-network cipher

Abstract

In this paper, we present a novel symmetric-key block cipher, with variable block and key lengths, referred to as PATFC (pseudorandom affine transformation-based Feistel cipher), suitable for software and hardware implementations. PATFC adopts the 3-round Luby-Rackoff construction (a compact form of the Feistel network structure) for fusing pseudorandom functions of the plaintext partitions to obtain a pseudorandom permutation. PATFC mainly makes use of a novel keyed pseudorandom function (PRF) that is based on a pseudorandom affine transformation (constructed using a highly nonlinear pseudorandom sequence generator) followed by a data and key dependent encoding and simple hash processes. Extensive statistical tests of PATFC and its underlying PRF consistently demonstrated their competitive diffusion, confusion and pseudorandomness characteristics. Furthermore, PATFC is probably secure and not vulnerable to known/chosen/adaptive plaintext/cipher text attacks