Results 21 to 30 of about 1,200 (188)
Algebraic and quantum attacks on two digital signature schemes
Journal of Mathematical Cryptology, 2023 In this article, we analyze two digital signature schemes, proposed in Moldovyan et al., that use finite noncommutative associative algebras as underlying platforms.
Roman’kov Vitaly +2 more
doaj +1 more source
IEEE Access, 2022 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
Advanced Algebraic Attack on Trivium [PDF]
, 2016 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 +1 more source
Review of algebraic attacks on stream ciphers
Tongxin xuebao, 2006 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
Algebraic attacks using SAT-solvers
Groups – Complexity – Cryptology, 2010 An algebraic attack on a cryptosystem consists of transforming the problem into the solution of a system of polynomial equations, usually over a finite field. The paper ``Algebraic attacks using SAT-solvers'' discusses different ways to efficiently transform the polynomial system into a logical clause.
Jovanovic, Philipp, Kreuzer, Martin
openaire +1 more source
Practical Algebraic Attack on DAGS [PDF]
, 2019 16 pages, accepted for publication in the 7th Code-Based Cryptography Workshop ...
Bardet, Magali +3 more
openaire +3 more sources
A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions
IEEE Access, 2019 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
Algebraic Attacks on RFID Protocols [PDF]
, 2009 This work aims to identify the algebraic problems which enable many attacks on RFID protocols. Toward this goal, three emerging types of attacks on RFID protocols, concerning authentication, untraceability, and secrecy are discussed. We demonstrate the types of attacks by exhibiting previously unpublished vulnerabilities in several protocols and ...
van Deursen, Ton, Radomirović, Saša
openaire +2 more sources
Comparative Study of Algebraic Attacks
IARJSET, 2016 Cryptographic schemes have an algebraic structure and can be described as multivariate polynomial equations. Even though algebra is the default tool in the cryptanalysis of asymmetric cryptosystems, there has been recently an increase in interest in the use of algebraic cryptanalysis techniques in the analysis of symmetric cryptosystems. The basic idea
Ahmed A Abdel-Hafez +2 more
openaire +1 more source
Entropy, 2015 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