170,937 research outputs found

    A NOVEL ARCHITECTURE WITH SCALABLE SECURITY HAVING EXPANDABLE COMPUTATIONAL COMPLEXITY FOR STREAM CIPHERS

    Get PDF
    Stream cipher designs are difficult to implement since they are prone to weaknesses based on usage, with properties being similar to one-time pad besides keystream is subjected to very strict requirements. Contemporary stream cipher designs are highly vulnerable to algebraic cryptanalysis based on linear algebra, in which the inputs and outputs are formulated as multivariate polynomial equations. Solving a nonlinear system of multivariate equations will reduce the complexity, which in turn yields the targeted secret information. Recently, Addition Modulo  has been suggested over logic XOR as a mixing operator to guard against such attacks. However, it has been observed that the complexity of Modulo Addition can be drastically decreased with the appropriate formulation of polynomial equations and probabilistic conditions. A new design for Addition Modulo is proposed. The framework for the new design is characterized by user-defined expandable security for stronger encryption and does not impose changes in existing layout for any stream cipher such as SNOW 2.0, SOSEMANUK, CryptMT, Grain Family, etc. The structure of the proposed design is highly scalable, which boosts the algebraic degree and thwarts the probabilistic conditions by maintaining the original hardware complexity without changing the integrity of the Addition Modulo

    Low dimensional manifolds for exact representation of open quantum systems

    Full text link
    Weakly nonlinear degrees of freedom in dissipative quantum systems tend to localize near manifolds of quasi-classical states. We present a family of analytical and computational methods for deriving optimal unitary model transformations based on representations of finite dimensional Lie groups. The transformations are optimal in that they minimize the quantum relative entropy distance between a given state and the quasi-classical manifold. This naturally splits the description of quantum states into quasi-classical coordinates that specify the nearest quasi-classical state and a transformed quantum state that can be represented in fewer basis levels. We derive coupled equations of motion for the coordinates and the transformed state and demonstrate how this can be exploited for efficient numerical simulation. Our optimization objective naturally quantifies the non-classicality of states occurring in some given open system dynamics. This allows us to compare the intrinsic complexity of different open quantum systems.Comment: Added section on semi-classical SR-latch, added summary of method, revised structure of manuscrip

    Automating embedded analysis capabilities and managing software complexity in multiphysics simulation part I: template-based generic programming

    Full text link
    An approach for incorporating embedded simulation and analysis capabilities in complex simulation codes through template-based generic programming is presented. This approach relies on templating and operator overloading within the C++ language to transform a given calculation into one that can compute a variety of additional quantities that are necessary for many state-of-the-art simulation and analysis algorithms. An approach for incorporating these ideas into complex simulation codes through general graph-based assembly is also presented. These ideas have been implemented within a set of packages in the Trilinos framework and are demonstrated on a simple problem from chemical engineering

    Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings I

    Get PDF
    We study the optimal approximation of the solution of an operator equation Au=f by linear and nonlinear mappings
    corecore