An adaptive security framework with extensible computational complexity for cipher systems

Abstract

Algebraic cryptanalysis, uses a range of algebraic tools and techniques to assess the security of cryptosystems, which are essential for trusted communications over open networks. Recent trends in algebraic cryptanalysis tend to use Modular Addition 2n over logic Exclusive-OR as a mixing operator to guard against security threats. We propose a newly designed framework for Modular Addition over field GF(2) satisfying the algebraic properties of regular Modular Addition 2n albeit with cumulative security enhancements and increased complexity to address these challenges. Nevertheless, it has been observed that the complexity of Modular Addition can be drastically decreased with the appropriate formulation of polynomial equations and probabilistic conditions. In this article we propose a new extended design framework for advanced Modular Addition and it is characterized by user-specified extendable security which does not impose additional changes in existing layout of ciphers including both stream and block ciphers. This framework can be rapidly scaled to use-specific requirements which boosts the algebraic degree of the overall structure. This, in turn it thwarts the probabilistic conditions by retaining the original hardware complexity sans critical modifications of Modular Addition 2n.