Results 41 to 50 of about 1,748,823 (282)
In this paper, we propose and evaluate a method for generating key-dependent feedback configurations (KDFC) for $\sigma $ -LFSRs. $\sigma $ -LFSRs with such configurations can be applied to any stream cipher that uses a word-based LFSR.
Subrata Nandi +3 more
doaj +1 more source
Review of algebraic attacks on stream ciphers
The basic theory and realizing methods of algebraic attacks on stream ciphers are presented.Then the algebraic attacks on stream ciphers with linear feedback shift register and the efficient techniques to decrease the degree of the nonlinear equations ...
ZHANG Long1, WU Wen-ling2, WEN Qiao-yan1
doaj +2 more sources
Yoneda Hacking: The Algebra of Attacker Actions
Our work focuses on modeling the security of systems from their component-level designs. Towards this goal, we develop a categorical formalism to model attacker actions. Equipping the categorical formalism with algebras produces two interesting results for security modeling.
Georgios Bakirtzis +2 more
openaire +2 more sources
Algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering
. This paper presents algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. For unstuttered SOBER-t32, two different attacks are implemented. In the first attack, we obtain multivariate equations of degree 10.
Cho, Joo Yeon +3 more
core +1 more source
A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions
Boolean functions should possess high fast algebraic immunity when used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the fast algebraic immunity of Boolean functions was usually calculated by the ...
Yindong Chen +3 more
doaj +1 more source
Advanced Algebraic Attack on Trivium [PDF]
This paper presents an algebraic attack against Trivium that breaks 625 rounds using only 4096 bits of output in an overall time complexity of $$2^{42.2}$$ Trivium computations. While other attacks can do better in terms of rounds 799, this is a practical attack with a very low data usage down from $$2^{40}$$ output bits and low computation time down ...
Frank-M. Quedenfeld, Christopher Wolf
openaire +2 more sources
Algebraic attacks have recently acquired great importance in the area of cryptography, not only due to the ciphers they have been able to break, but more importantly, because the principle of algebraic attacks is very generic and can be applied to break ...
Agrawal, Shweta Prem
core +1 more source
On the security of the LILI family of stream ciphers against algebraic attacks
In this paper, we present an algebraic analysis of the LILI family of stream ciphers, and in particular LILI-II, and investigate the security provided against both standard and fast algebraic attacks.
Matt Henricksen +7 more
core +1 more source
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Since Advanced Encryption Standard (AES) in stream modes, such as counter (CTR), output feedback (OFB) and cipher feedback (CFB), can meet most industrial requirements, the range of applications for dedicated stream ciphers is decreasing.
Jun Choi +3 more
doaj +1 more source

