Suchergebnisse - (( Key yorks. boolean function complexity ) OR ( key work. boolean function complexity ))*

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

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

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

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

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

STRAUSS: Spectral Transform Use in Stochastic Circuit Synthesis von Alaghi, Armin, Hayes, John P.

“… Its key advantages are low-complexity hardware and high-error tolerance. SC has recently been finding application in several important areas, including image processing, artificial neural networks, and low-density parity check decoding …”
Volltext

Improved Bounds for Wireless Localization von Christ, Tobias, Hoffmann, Michael, Okamoto, Yoshio, Uno, Takeaki

“… In other words, the interior of the polygon must be described by a monotone Boolean formula composed from the keys …”
Volltext

Perfect Tabular Hashing in Pseudolinear Time von Palit, Shekhar, Wortman, Kevin A.

“… We present an algorithm for generating perfect tabulation hashing functions by reduction to Boolean satisfaction (SAT …”
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

Exploiting symmetry in SAT-based boolean matching for heterogeneous FPGA technology mapping von Yu Hu, Shih, V., Majumdar, R., Lei He

“… The Boolean matching problem is a key procedure in technology mapping for heterogeneous field programmable gate arrays (FPGA …”
Volltext

Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses von Samajder, Subhabrata, Sarkar, Palash

“… Expressions for the success probability in terms of the data complexity and the advantage are obtained using the general key randomisation hypotheses for both multidimensional and multiple linear …”
Volltext

On the security of biquadratic C∗ public-key cryptosystems and its generalizations von Felke, Patrick

“… Public key cryptosystems based on multivariate polynomials have been studied since the eighties …”
Volltext

Exploiting the Incomplete Diffusion Feature: A Specialized Analytical Side-Channel Attack Against the AES and Its Application to Microcontroller Implementations von Shize Guo, Xinjie Zhao, Fan Zhang, Tao Wang, Shi, Zhijie Jerry, Standaert, Francois-Xavier, Chujiao Ma

“… It falls under analytical side-channel attack and can recover the entire key at once. Many ASCAs are proposed against the AES, and they utilize …”
Volltext

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

Statistical integral distinguisher with multi-structure and its application on AES-like ciphers von Cui, Tingting, Chen, Huaifeng, Mesnager, Sihem, Sun, Ling, Wang, Meiqin

“… In order to reduce the time complexity of original integral one, Wang et al. firstly proposed a statistical integral distinguisher at FSE’16. However …”
Volltext

Analysis of Computational Time of Simple Estimation of Distribution Algorithms von Chen, Tianshi, Tang, Ke, Chen, Guoliang, Yao, Xin

“… Impressive experimental results have been reported in the literature. However, little work has been done on analyzing the computation time of EDAs in relation to the problem size …”
Volltext

New approach of exploiting symmetry in SAT-based Boolean matching for FPGA technology mapping von Xiu-qin, Wang, Yang, Yang

“… Boolean matching is a key procedure in FPGA technology mapping. SAT-based Boolean matching provides a flexible solution for exploring various FPGA architectures …”
Volltext

Further improvements of the estimation of key enumeration with applications to solving LWE von Budroni, Alessandro, Mårtensson, Erik

“… The attack strategy consists of a lattice reduction part and a distinguishing part. The latter includes an enumeration subroutine over a certain number of positions of the secret key …”
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

Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic von Bettale, Luk, Faugère, Jean-Charles, Perret, Ludovic

“… —instead of a univariate polynomial in HFE—over an extension field as a private key. According to the authors, this should make the classical direct algebraic (message-recovery …”
Volltext