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

Andere Suchmöglichkeiten:

  1. 1

    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.

    ISSN: 1041-4347, 1558-2191
    Veröffentlicht: New York IEEE 01.05.2023
    Veröffentlicht in IEEE transactions on knowledge and data engineering (01.05.2023)
    “… ), massive spatio-textual data has been outsourced to cloud servers for storage and analysis such as spatial keyword search …”
    Volltext
    Journal Article
  2. 2

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

    ISSN: 0018-9448, 1557-9654
    Veröffentlicht: New York, NY IEEE 01.07.2011
    Veröffentlicht in IEEE transactions on information theory (01.07.2011)
    “… 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
    Journal Article
  3. 3

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

    ISSN: 2752-6542, 2752-6542
    Veröffentlicht: England Oxford University Press 01.03.2022
    Veröffentlicht in PNAS nexus (01.03.2022)
    “… However, the Boolean functions (BFs) specifying the associated logical update rules should not be expected to be random …”
    Volltext
    Journal Article
  4. 4

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

    ISSN: 2689-1808, 2689-1808
    Veröffentlicht: New York IEEE 2025
    Veröffentlicht in IEEE transactions on quantum engineering (2025)
    “… 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
    Journal Article
  5. 5

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

    ISSN: 0018-9448, 1557-9654
    Veröffentlicht: New York, NY IEEE 01.07.2006
    Veröffentlicht in IEEE transactions on information theory (01.07.2006)
    “… 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
    Journal Article
  6. 6

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

    ISSN: 1089-778X, 1941-0026
    Veröffentlicht: New York IEEE 01.10.2018
    Veröffentlicht in IEEE transactions on evolutionary computation (01.10.2018)
    “… 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
    Journal Article
  7. 7

    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.

    ISSN: 1545-5963, 1557-9964, 1557-9964
    Veröffentlicht: United States IEEE 01.01.2022
    “… A key objective of studying biological systems is to design therapeutic intervention strategies for beneficially altering cell dynamics …”
    Volltext
    Journal Article
  8. 8

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

    ISSN: 1432-4350, 1433-0490
    Veröffentlicht: New York Springer US 01.11.2020
    Veröffentlicht in Theory of computing systems (01.11.2020)
    “… ) , where F is a set of constraint functions on Boolean variables and taking complex values …”
    Volltext
    Journal Article
  9. 9

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

    ISSN: 0278-0070, 1937-4151
    Veröffentlicht: New York IEEE 01.10.2023
    “… 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
    Journal Article
  10. 10

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

    ISSN: 1558-1101
    Veröffentlicht: EDAA 01.02.2021
    “… For very large Boolean circuits most approximate logic synthesis techniques successively apply local approximation transformations affecting only a portion of the whole design …”
    Volltext
    Tagungsbericht
  11. 11

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

    ISSN: 0090-6778, 1558-0857
    Veröffentlicht: New York IEEE 01.01.2022
    Veröffentlicht in IEEE transactions on communications (01.01.2022)
    “… 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 …”
    Volltext
    Journal Article
  12. 12

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

    ISSN: 0018-9448, 1557-9654
    Veröffentlicht: New York, NY IEEE 01.08.2008
    Veröffentlicht in IEEE transactions on information theory (01.08.2008)
    “… 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 …”
    Volltext
    Journal Article
  13. 13

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

    ISSN: 0933-2790, 1432-1378
    Veröffentlicht: New York Springer Nature B.V 01.10.2025
    Veröffentlicht in Journal of cryptology (01.10.2025)
    “… 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 …”
    Volltext
    Journal Article
  14. 14

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

    ISSN: 0018-9219, 1558-2256
    Veröffentlicht: New York IEEE 01.09.2018
    Veröffentlicht in Proceedings of the IEEE (01.09.2018)
    “… 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
    Journal Article
  15. 15

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

    ISSN: 0018-9340, 1557-9956
    Veröffentlicht: New York IEEE 01.06.2022
    Veröffentlicht in IEEE transactions on computers (01.06.2022)
    “… In this article, a new strategy, maximum last <inline-formula><tex-math notation="LaTeX">\alpha</tex-math> …”
    Volltext
    Journal Article
  16. 16

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

    ISSN: 2575-8454
    Veröffentlicht: IEEE 01.11.2020
    “… The recent emergence of fine-grained cryptography strongly motivates developing an average-case analogue of Fine-Grained Complexity (FGC). Prior work …”
    Volltext
    Tagungsbericht
  17. 17

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

    ISSN: 1545-5963, 1557-9964, 1557-9964
    Veröffentlicht: United States IEEE 01.01.2010
    “… A key problem in molecular biology is to infer regulatory relationships between genes from expression data …”
    Volltext
    Journal Article
  18. 18

    Physically Unclonable and Reconfigurable Computing System (PURCS) for Hardware Security Applications von Shanta, Aysha S., Majumder, Md. Badruddoja, Hasan, Md. Sakib, Rose, Garrett S.

    ISSN: 0278-0070, 1937-4151
    Veröffentlicht: New York IEEE 01.03.2021
    “… A chaotic oscillator is required to generate the chaotic signals and can produce different Boolean functions using different tuning parameters, including a control bit, iteration number, threshold …”
    Volltext
    Journal Article
  19. 19

    A Boolean Network Approach to Estrogen Transcriptional Regulation von Hernández-Lemus, Enrique, Sandoval-Motta, Santiago, Espinal-Enríquez, Jesús, Anda-Jáuregui, Guillermo de

    ISSN: 1076-2787, 1099-0526
    Veröffentlicht: Cairo, Egypt Hindawi Publishing Corporation 01.01.2019
    Veröffentlicht in Complexity (New York, N.Y.) (01.01.2019)
    “… Estrogen is a sex hormone known for its roles in cell proliferation. Its expression has been involved in several physiological functions such as regulating the menstrual and reproduction cycles in women …”
    Volltext
    Journal Article
  20. 20

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

    ISSN: 0018-9340, 1557-9956
    Veröffentlicht: New York IEEE 01.01.2019
    Veröffentlicht in IEEE transactions on computers (01.01.2019)
    “… 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 …”
    Volltext
    Journal Article