Suchergebnisse - key (((yorks. OR works.) OR (yorks. OR works.)) OR work.) boolean function complexity~

Boolean semiring key-exchange with BLAKE3 security (BKEX-B3) von Alvary Kefas Kwala, Alpna Mishra, Shri Kant

“… This work presents a new Boolean Semiring Key Exchange Protocol combined with BLAKE3 cryptographic hash function (BKEX-B3 …”
Volltext

A Grover-Meets-Simon Approach to Match Vector Boolean Functions von Venere, Marco, Barenghi, Alessandro, Pelosi, Gerardo

“… The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables …”
Volltext

Algebraic immunity for cryptographically significant Boolean functions: analysis and construction von Carlet, C., Dalai, D.K., Gupta, K.C., Maitra, S.

“… It has been observed that a Boolean function f used as a cryptographic primitive, and interpreted as a multivariate polynomial over F/sub 2/, should not have low degree multiples obtained …”
Volltext

A direct product theorem for quantum communication complexity with applications to device-independent QKD von Jain, Rahul, Kundu, Srijita

“… ). For a two-input boolean function, the best result for interactive quantum communication complexity known previously was due to Sherstov (2018 …”
Volltext

Privacy-Preserving Boolean Range Query With Temporal Access Control in Mobile Computing von Tong, Qiuyun, Li, Xinghua, Miao, Yinbin, Liu, Ximeng, Weng, Jian, Deng, Robert H.

“… ), massive spatio-textual data has been outsourced to cloud servers for storage and analysis such as spatial keyword search …”
Volltext

Improved bounds on the AN-complexity of O(1)-linear functions von Goldreich, Oded

“… We consider arithmetic circuits with arbitrary gates for computing Boolean functions that are represented by low-degree polynomials over GF(2 …”
Volltext

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions von Ye, Ze-Kun, Li, Lv-Zhou

“… ? This problem has been addressed in the literature for total Boolean functions and symmetric partial Boolean functions, but is still open for general partial Boolean functions …”
Volltext

Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions von Liu, Meicheng, Lin, Dongdai, Pei, Dingyi

“… In this correspondence, first we give a decomposition of symmetric Boolean functions, then we show that almost all symmetric Boolean functions, including these functions with good algebraic immunity …”
Volltext

Minimum complexity drives regulatory logic in Boolean models of living systems von Subbaroyan, Ajay, Martin, Olivier C, Samal, Areejit

“… However, the Boolean functions (BFs) specifying the associated logical update rules should not be expected to be random …”
Volltext

Efficient minimization of higher order submodular functions using monotonic Boolean functions von Ramalingam, Srikumar, Russell, Chris, Ladický, L’ubor, Torr, Philip H.S.

“… Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others …”
Volltext

Alternative approach to calculate the structure matrix of Boolean network with semi-tensor product von Zhang, Xiao Hua, Han, Hua Xiang, Sun, Zhi Jian, Zhang, Wei Dong

“… The key of the proposed new method is applying the superposition and expansion techniques to the initial matrix and the target matrix, which dramatically reduces computational complexity …”
Volltext

SMC: Satisfiability Modulo Convex Programming von Shoukry, Yasser, Nuzzo, Pierluigi, Sangiovanni-Vincentelli, Alberto L., Seshia, Sanjit A., Pappas, George J., Tabuada, Paulo

“… Boolean methods such as satisfiability (SAT) solving are successful in tackling large combinatorial search problems for the design and verification of hardware and software components …”
Volltext

Level-Based Analysis of Genetic Algorithms and Other Search Processes von Corus, Dogan, Dang, Duc-Cuong, Eremeev, Anton V., Lehre, Per Kristian

“… Understanding how the time complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation …”
Volltext

Network Classification Based on Reducibility With Respect to the Stability of Canalizing Power of Genes in a Gene Regulatory Network - A Boolean Network Modeling Perspective von Kim, Eunji, Ivanov, Ivan, Dougherty, Edward R.

“… A key objective of studying biological systems is to design therapeutic intervention strategies for beneficially altering cell dynamics …”
Volltext

Dichotomy for Holant∗ Problems on the Boolean Domain von Cai, Jin-Yi, Lu, Pinyan, Xia, Mingji

“… ) , where F is a set of constraint functions on Boolean variables and taking complex values …”
Volltext

Conditional Dichotomy of Boolean Ordered Promise CSPs von Brakensiek, Joshua, Guruswami, Venkatesan, Sandeep, Sai

“… \aa stad, there has been a flurry of works on PCSPs [BBKO19,KO19,WZ20]. The key tool in studying PCSPs is the algebraic framework developed in the context of CSPs …”
Volltext

New Techniques for Proving Fine-Grained Average-Case Hardness von Dalirrooyfard, Mina, Lincoln, Andrea, Williams, Virginia Vassilevska

“… The recent emergence of fine-grained cryptography strongly motivates developing an average-case analogue of Fine-Grained Complexity (FGC). Prior work …”
Volltext

Complexity Analysis of the SAT Attack on Logic Locking von Zhong, Yadi, Guin, Ujjwal

“… Logic locking emerges as a primary design-for-security measure to counter these threats, where ICs become fully functional only when unlocked with a secret key …”
Volltext

An Extended Analysis of the Correlation Extraction Algorithm in the Context of Linear Cryptanalysis von Graebnitz, Christoph, Pickel, Valentin, Eble, Holger, Morgner, Frank, Hattenbach, Hannes, Margraf, Marian

“… Since these linear cryptanalytic techniques require exploitable linear approximations to relate the input and output of vectorial Boolean functions, e.g …”
Volltext

Approximate Logic Synthesis of Very Large Boolean Networks von Echavarria, Jorge, Wildermann, Stefan, Teich, Jurgen

“… For very large Boolean circuits most approximate logic synthesis techniques successively apply local approximation transformations affecting only a portion of the whole design …”
Volltext