Results 21 to 30 of about 1,748,823 (282)

Algebraic Attacks on Block Ciphers Using Quantum Annealing

open access: yesIEEE Transactions on Emerging Topics in Computing, 2022
This paper presents the transformation method of the system of algebraic equations describing the symmetric cipher into the QUBO problem. After transformation of given equations $f_0, f_1, \ldots, f_{n-1}$f0,f1,...,fn-1 to equations over integers $f ...
Elżbieta Burek   +3 more
semanticscholar   +1 more source

Stream/block ciphers, difference equations and algebraic attacks [PDF]

open access: yesJournal of symbolic computation, 2020
In this paper we introduce a general class of stream and block ciphers that are defined by means of systems of (ordinary) explicit difference equations over a finite field. We call this class "difference ciphers".
R. L. Scala, S. Tiwari
semanticscholar   +1 more source

Algebraic Decomposition Method for Zero Watermarking Technique in YCbCr Space [PDF]

open access: yesEngineering and Technology Journal, 2022
The close connection between mathematics, especially linear algebra, and computer science has greatly impacted the development of several fields, and the most important is image processing.
Nada Mohammed, Areej Abduldaim
doaj   +1 more source

High Order Side-Channel Security for Elliptic-Curve Implementations

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2022
Elliptic-curve implementations protected with state-of-the-art countermeasures against side-channel attacks might still be vulnerable to advanced attacks that recover secret information from a single leakage trace.
Sonia Belaïd, Matthieu Rivain
doaj   +1 more source

Cryptanalysis of ARX-based White-box Implementations

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2023
At CRYPTO’22, Ranea, Vandersmissen, and Preneel proposed a new way to design white-box implementations of ARX-based ciphers using so-called implicit functions and quadratic-affine encodings. They suggest the Speck block-cipher as an example target.
Alex Biryukov   +2 more
doaj   +1 more source

Algebraic Attacks Galore! [PDF]

open access: yesGroups – Complexity – Cryptology, 2009
Summary: This is the first in a two-part survey of current techniques in algebraic cryptanalysis. After introducing the basic setup of algebraic attacks and discussing several attack scenarios for symmetric cryptosystems, public key cryptosystems, and stream ciphers, we discuss a number of individual methods. The XL, XSL, and MutantXL attacks are based
openaire   +1 more source

Algebraic Attacks on Combiners with Memory [PDF]

open access: yes, 2003
Recently, algebraic attacks were proposed to attack several cryptosystems, e.g. AES, LILI-128 and Toyocrypt. This paper extends the use of algebraic attacks to combiners with memory. A (k,l)-combiner consists of k parallel linear feedback shift registers (LFSRs), and the nonlinear filtering is done via a finite automaton with k input bits and l memory ...
Armknecht, Frederik, Krause, Matthias
openaire   +1 more source

Algebraic Description and Simultaneous Linear Approximations of Addition in Snow 2.0. [PDF]

open access: yes, 2008
In this paper we analyse the algebraic properties over the field GF(2) of the addition modulo 2pn. We look at implicit quadratic equations describing this operation, and at probabilistic conditional linear equations.
Nicolas T. Courtois   +3 more
core   +1 more source

Algebraic Persistent Fault Analysis of SKINNY_64 Based on S_Box Decomposition

open access: yesEntropy, 2022
Algebraic persistent fault analysis (APFA), which combines algebraic analysis with persistent fault attacks, brings new challenges to the security of lightweight block ciphers and has received widespread attention since its introduction.
Xing Fang   +5 more
doaj   +1 more source

Strengthening Crypto-1 Cipher Against Algebraic Attacks

open access: yesJournal of ICT Research and Applications, 2015
In the last few years, several studies addressed the problem of data security in Mifare Classic. One of its weaknesses is the low random number quality. This causes SAT solver attacks to have lower complexity.
Farah Afianti, Ari M. Barmawi
doaj   +1 more source

Home - About - Disclaimer - Privacy