Search Results - key ((yorks. OR yorks.) OR york.) boolean function complexity*

Privacy-Preserving Boolean Range Query With Temporal Access Control in Mobile Computing by 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…”
Get full text

Minimum complexity drives regulatory logic in Boolean models of living systems by 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…”
Get full text

Complexity Analysis of the SAT Attack on Logic Locking by 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…”
Get full text

Level-Based Analysis of Genetic Algorithms and Other Search Processes by 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…”
Get full text

Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions by 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…”
Get full text

A Grover-Meets-Simon Approach to Match Vector Boolean Functions by 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…”
Get full text

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 by 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…”
Get full text

On the Efficiency of Polar-Like Decoding for Symmetric Codes by Ivanov, Kirill, Urbanke, Rudiger L.

“… grows too fast to make the decoding practical even for moderate block lengths. The key ingredient for proving the capacity-achieving property of Reed-Muller and eBCH codes is their group of symmetries…”
Get full text

SMC: Satisfiability Modulo Convex Programming by 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…”
Get full text

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

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

Improving Linear Key Recovery Attacks using Walsh Spectrum Puncturing by Flórez-Gutiérrez, Antonio, Todo, Yosuke

“…In most linear key recovery attacks on block ciphers, the value of the target linear approximation is determined from the plaintext, ciphertext and key by a function…”
Get full text

Approximate Logic Synthesis of Very Large Boolean Networks by 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…”
Get full text

Some Conditional Cube Testers for Grain-128a of Reduced Rounds by Dalai, Deepak Kumar, Pal, Santu, Sarkar, Santanu

“…In this article, a new strategy, maximum last <inline-formula><tex-math notation="LaTeX">\alpha</tex-math>…”
Get full text

Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity by Mesnager, S.

“… The algebraic immunity of a Boolean function quantifies its resistance to the standard algebraic attacks of the pseudorandom generators using it as a nonlinear filtering or combining function…”
Get full text

New Techniques for Proving Fine-Grained Average-Case Hardness by 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…”
Get full text

A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data by Perkins, T.J., Hallett, M.T.

“…A key problem in molecular biology is to infer regulatory relationships between genes from expression data…”
Get full text

On Analysis of Lightweight Stream Ciphers with Keyed Update by Kara, Orhun, Esgin, Muhammed F.

“… ciphers in compliance with the rule of thumb that the internal state size should be at least twice as the key size to defend against generic Time-Memory-Data Tradeoff (TMDT) attacks…”
Get full text

A New Cube Attack on MORUS by Using Division Property by Ye, Tao, Wei, Yongzhuang, Meier, Willi

“…MORUS is an authenticated encryption algorithm and one of the candidates in the CAESAR competition. Currently, the security of MORUS received extensive…”
Get full text

Fast Discrete Fourier Spectra Attacks on Stream Ciphers by Guang Gong, Ronjom, S., Helleseth, T., Honggang Hu

“…In this paper, some new results are presented on the selective discrete Fourier spectra attack introduced first as the Rønjom-Helleseth attack and the…”
Get full text

On Guess and Determine Cryptanalysis of LFSR-Based Stream Ciphers by Pasalic, E.

“…In this paper, the complexity of applying a guess and determine attack to so-called Linear Feedback Shift register (LFSR…”
Get full text