Results 11 to 20 of about 315,143 (255)

Cryptanalysis of a white‐box SM4 implementation based on collision attack

open access: yesIET Information Security, 2022
White‐box cryptography is to primarily protect the key of a cipher from being extracted in a white‐box scenario, where an adversary has full access to the execution environment of software implementation. Since the introduction of white‐box cryptography,
Rusi Wang   +3 more
doaj   +1 more source

Computability-theoretic learning complexity [PDF]

open access: yesPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2012
Initially discussed are some of Alan Turing's wonderfully profound and influential ideas about mind and mechanism—including regarding their connection to the main topic of the present study, which is within the field of computability-theoretic learning theory.
Case, J., Kötzing, T.
openaire   +4 more sources

Group mixing drives inequality in face-to-face gatherings

open access: yesCommunications Physics, 2022
The emergence of inequality in social interactions can depend on a number of factors, among which the intrinsic attractiveness of individuals, but also group size the presence of pre-formed social ties.
Marcos Oliveira   +5 more
doaj   +1 more source

Exploring disparities and novel insights into metabolic and cardiovascular comorbidities among COVID-19 patients in Mexico

open access: yesFrontiers in Public Health, 2023
IntroductionThe COVID-19 pandemic, especially its early stages, sparked extensive discussions regarding the potential impact of metabolic and cardiovascular comorbidities on the severity and fatality of SARS-CoV-2 infection, yielding inconclusive ...
Jonathan Ariel López-Cuevas   +7 more
doaj   +1 more source

A Robust Version of Heged\H{u}s's Lemma, with Applications [PDF]

open access: yesTheoretiCS, 2023
Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in \mathbb{F}[x_1 ...
Srikanth Srinivasan
doaj   +1 more source

Yoyo trick on type‐II generalised Feistel networks

open access: yesIET Information Security, 2021
This work presents a structural attack against the type‐II generalised Feistel network (GFN) with secret internal functions. First, equivalent structures of the 7‐round type‐II GFN are provided, which helps reduce the first guess of the secret round ...
Tao Hou, Ting Cui
doaj   +1 more source

Functional impact of multi-omic interactions in breast cancer subtypes

open access: yesFrontiers in Genetics, 2023
Multi-omic approaches are expected to deliver a broader molecular view of cancer. However, the promised mechanistic explanations have not quite settled yet. Here, we propose a theoretical and computational analysis framework to semi-automatically produce
Soledad Ochoa   +3 more
doaj   +1 more source

Computational Power Evaluation for Energy-Constrained Wireless Communications Systems

open access: yesIEEE Open Journal of the Communications Society, 2020
Estimating the power consumption and computational complexity of various digital signal processing (DSP) algorithms used in wireless communications systems is critical to assess the feasibility of implementing such algorithms in hardware, and for ...
Maryam Tariq   +4 more
doaj   +1 more source

Molecular mechanisms of multi-omic regulation in breast cancer

open access: yesFrontiers in Oncology, 2023
Breast cancer is a complex disease that is influenced by the concurrent influence of multiple genetic and environmental factors. Recent advances in genomics and other high throughput biomolecular techniques (-omics) have provided numerous insights into ...
Soledad Ochoa   +3 more
doaj   +1 more source

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing [PDF]

open access: yesTheoretiCS, 2022
A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly self-ordered if the
Oded Goldreich, Avi Wigderson
doaj   +1 more source

Home - About - Disclaimer - Privacy