Suchergebnisse - key (((works. OR works.) 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 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

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

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

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

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

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

Complex adaptive systems: an introduction to computational models of social life. von Miller, John H, Miller, John H, Page, Scott E

“… Engagingly written, and balancing technical detail with intuitive explanations,Complex Adaptive Systemsfocuses on the key tools and ideas that have emerged in the field since the mid-1990s, as well …”
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

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

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

A simpler counterexample to a long-standing conjecture on the complexity of Bryantʼs apply algorithm von Bollig, Beate

“… functions by a Boolean operator, and equivalence checking. Based on his empirical evaluation he has conjectured that his apply algorithm for the synthesis works in linear time with respect to the input and output size …”
Volltext

On the measurement complexity of differentially private query answering von Wang, LiWei, Zhang, JiaPeng

“… Differentially private query answering is an important problem in machine learning and data anal- ysis. As an example, the users may want to know the empirical …”
Volltext

Characterizing the Impact of Communication on Cellular and Collective Behavior Using a Three-Dimensional Multiscale Cellular Model von Echlin, Moriah, Aguilar, Boris, Shmulevich, Ilya

“… Communication between cells enables the coordination that drives structural and functional complexity in biological systems …”
Volltext

Variable elimination strategies and construction of nonlinear polynomial invariant attacks on T-310 von Courtois, Nicolas T., Georgiou, Marios

“… We work by progressive elimination of specific variables in polynomial spaces and we show that one can totally eliminate big chunks of the cipher circuit …”
Volltext

Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers von Zhong, Jianghua, Lin, Dongdai

“… ) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits …”
Volltext

On the sample complexity of linear code equivalence for all code rates von Budroni, Alessandro, Natale, Andrea

“… In this work, we generalize the proposed attacks to cover all code rates. We show that the complexity …”
Volltext

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

“… \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

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