On Cryptographic Attacks Using Backdoors for SAT

Семенов, А. А.; Zaikin, Oleg; Otpuschennikov, Ilya V.; Kochemazov, Stepan; Ignatiev, Alexey

doi:10.1609/aaai.v32i1.12205

Cited by 22 publications

(16 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although these methodologies to design the structures of S-boxes offer favorable characteristics, researchers have also pointed out the weaknesses of these approaches 42 . Many statistical attacks are available for the assembly of S-box designs, including linear and differential [43][44][45] , interpolation 46 , Grobner basis 47 , side-channel 48 , SAT solver 49 , XL 50 , and XSL 51 attacks. Chaos-based systems have been used extensively in the construction of confusion components 52,53 , but owing to the inherent algorithmic advancement of control parameters and periodicity in the maps, several weaknesses of these systems also exist in the literature, including discontinuity and non-uniform distribution in chaotic sequences 54,55 , predictability 56,57 , finite precision effect and short quantity of randomness 58,59 , dynamical degradation of chaotic systems and frail chaos 60,61 , and a small number of control parameters 62,63 .…”

Section: Related Workmentioning

confidence: 99%

Design of highly nonlinear confusion component based on entangled points of quantum spin states

Waseem

Hwang

2023

Sci Rep

View full text Add to dashboard Cite

Cryptosystems are commonly deployed to secure data transmission over an insecure line of communication. To provide confusion in the data over insecure networks, substitution boxes are the solitary components for delivering a nonlinear mapping between inputs and outputs. A confusion component of a block cipher with high nonlinearity and low differential and linear approximation probabilities is considered secure against cryptanalysis. This study aims to design a highly nonlinear substitution-permutation network using the blotch symmetry of quantum spin states on the Galois field GF (28). To observe the efficiency of the proposed methodology, some common and advanced measures were evaluated for performance, randomness, and cryptanalytics. The outcomes of these analyses validate that the generated nonlinear confusion components are effective for block ciphers and attain better cryptographic strength with a high signal-to-noise ratio in comparison to state-of-the-art techniques.

show abstract

Section: Related Workmentioning

confidence: 99%

Design of highly nonlinear confusion component based on entangled points of quantum spin states

Waseem

Hwang

2023

Sci Rep

View full text Add to dashboard Cite

show abstract

“…As mentioned earlier, chaos-and algebraic-based techniques are extensively used to design the confusion component. Chaos-and algebraic-based techniques provide favorable features for the design of confusion components; however, researchers have also identified various cryptanalysis on these techniques including interpolation attacks [9][10][11][12], Gröbner basis attack [13][14][15][16][17][18][19], SAT solver [20][21][22][23][24][25][26][27], linear and differential attacks [28][29][30][31][32][33][34][35][36][37][38][39][40][41][42], XL attacks [43][44][45], and XSL attack [9,[46][47][48][49][50][51][52][53][54][55]. Similarly, ...…”

Section: Attacks On Confusion Component Design Schemesmentioning

confidence: 99%

“…Similarly, the main objective of the linear attack is to try to learn the linear association between the parity bits of cipher text, plaintext, and the symmetric key. Responsibility to make the correlation between ciphertext and the key, as undetectable as possible, is only on the confusion component, as well as resistance against the cryptanalysis attacks totally depends upon the confusion component [13][14][15][16][17][18][19][20][21][22].…”

Section: Introductionmentioning

confidence: 99%

Human Psychological Disorder towards Cryptography: True Random Number Generator from EEG of Schizophrenics and Its Application in Block Encryption’s Substitution Box

Khan

Saleem

Hazzazi

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

Schizophrenia is a multifaceted chronic psychiatric disorder that affects the way a human thinks, feels, and behaves. Inevitably, natural randomness exists in the psychological perception of schizophrenic patients, which is our primary source of inspiration for this research because true randomness is the indubitably ultimate valuable resource for symmetric cryptography. Famous information theorist Claude Shannon gave two desirable properties that a strong encryption algorithm should have, which are confusion and diffusion in his fundamental article on the theoretical foundations of cryptography. Block encryption strength against various cryptanalysis attacks is purely dependent on its confusion property, which is gained through the confusion component. In the literature, chaos and algebraic techniques are extensively used to design the confusion component. Chaos- and algebraic-based techniques provide favorable features for the design of the confusion component; however, researchers have also identified potential attacks on these techniques. Instead of existing schemes, we introduce a novel methodology to construct cryptographic confusion component from the natural randomness, which are existing in the psychological perception of the schizophrenic patients, and as a result, cryptanalysis of chaos and algebraic techniques are not applicable on our proposed technique. The psychological perception of the brain regions was captured through the electroencephalogram (EEG) readings during the sensory task. The proposed design passed all the standard evaluation criteria and validation tests of the confusion component and the random number generators. One million true random bits are assessed through the NIST statistical test suite, and the results proved that the psychological perception of schizophrenic patients is a good source of true randomness. Furthermore, the proposed confusion component attains better or equal cryptographic strength as compared to state-of-the-art techniques (2020 to 2021). To the best of our knowledge, this nature of research is performed for the first time, in which psychiatric disorder is utilized for the design of information security primitive. This research opens up new avenues in cryptographic primitive design through the fusion of computing, neuroscience, and mathematics.

show abstract

“…The problem of evaluating the decomposition hardness in (Semenov et al 2021) was reduced to the optimization of the pseudo-Boolean black-box function, which was carried out using evolutionary algorithms. In (Semenov et al 2018), a special class of backdoor sets was introduced that enables one to estimate the hardness of cryptographic guessand-determine attacks (Bard 2009).…”

Section: Introductionmentioning

confidence: 99%

On Probabilistic Generalization of Backdoors in Boolean Satisfiability

Семенов

Pavlenko

Chivilikhin

et al. 2022

AAAI

Self Cite

View full text Add to dashboard Cite

The paper proposes a probabilistic generalization of the well-known Strong Backdoor Set (SBS) concept applied to the Boolean Satisfiability Problem (SAT). We call a set of Boolean variables B a ρ-backdoor, if for a fraction of at least ρ of possible assignments of variables from B, assigning their values to variables in a Boolean formula in Conjunctive Normal Form (CNF) results in polynomially solvable formulas. Clearly, a ρ-backdoor with ρ=1 is an SBS. For a given set B it is possible to efficiently construct an (ε, δ)-approximation of parameter ρ using the Monte Carlo method. Thus, we define an (ε, δ)-SBS as such a set B for which the conclusion "parameter ρ deviates from 1 by no more than ε" is true with probability no smaller than 1 - δ. We consider the problems of finding the minimum SBS and the minimum (ε, δ)-SBS. To solve the former problem, one can use the algorithm described by R. Williams, C. Gomes and B. Selman in 2003. In the paper we propose a new probabilistic algorithm to solve the latter problem, and show that the asymptotic estimation of the worst-case complexity of the proposed algorithm is significantly smaller than that of the algorithm by Williams et al. For practical applications, we suggest a metaheuristic optimization algorithm based on the penalty function method to seek the minimal (ε, δ)-SBS. Results of computational experiments show that the use of (ε, δ)-SBSes found by the proposed algorithm allows speeding up solving of test problems related to equivalence checking and hard crafted and combinatorial benchmarks compared to state-of-the-art SAT solvers.

show abstract

On Cryptographic Attacks Using Backdoors for SAT

Cited by 22 publications

References 21 publications

Design of highly nonlinear confusion component based on entangled points of quantum spin states

Design of highly nonlinear confusion component based on entangled points of quantum spin states

Human Psychological Disorder towards Cryptography: True Random Number Generator from EEG of Schizophrenics and Its Application in Block Encryption’s Substitution Box

On Probabilistic Generalization of Backdoors in Boolean Satisfiability

Contact Info

Product

Resources

About