Results 101 to 110 of about 12,820,749 (293)

A Fast Single-Key Two-Level Universal Hash Function

open access: yesIACR Transactions on Symmetric Cryptology, 2017
Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty   +2 more
doaj   +1 more source

Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning

open access: yesAdvanced Intelligent Discovery, EarlyView.
This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley   +1 more source

PUBLIC KEY CRYPTOGRAPHY USING PERMUTATION P-POLYNOMIALS OVER FINITE FIELDS [PDF]

open access: yes, 2009
In this paper we propose an efficient multivariate public key cryptosystem based on permutation p-polynomials over finite fields. We first characterize a class of permutation p-polynomials over finite fields $F_{q^{m}}$ and then construct a trapdoor ...
Rajesh P Singh, A. Saikia, B. K. Sarma
core   +1 more source

Factoring Polynomials over Special Finite Fields

open access: yesFinite Fields and Their Applications, 2001
The main result of this paper is a theoretical algorithm to factorize polynomials over large finite fields (Theorem~1 below). Let \(\Phi_k\) be the \(k\)th cyclotomic polynomial. Then the authors prove the following results. Theorem 1. There is a deterministic algorithm such that, for some constant \(c>0\) -- given a prime \(p\), positive integers \(n\)
Lenstra, H.W.   +2 more
openaire   +3 more sources

Composition‐Aware Cross‐Sectional Integration for Spatial Transcriptomics

open access: yesAdvanced Intelligent Discovery, EarlyView.
Multi‐section spatial transcriptomics demands coherent cell‐type deconvolution, domain detection, and batch correction, yet existing pipelines treat these tasks separately. FUSION unifies them within a composition‐aware latent framework, modeling reads as cell‐type–specific topics and clustering in embedding space.
Qishi Dong   +5 more
wiley   +1 more source

A circuit area optimization of MK-3 S-box

open access: yesCybersecurity
In MILCOM 2015, Kelly et al. proposed the authentication encryption algorithm MK-3, which applied the 16-bit S-box. This paper aims to implement the 16-bit S-box with less circuit area. First, we classified the irreducible polynomials over $$\mathbb {F}_{
Yanjun Li   +4 more
doaj   +1 more source

Feasibility of primality in bounded arithmetic

open access: yesForum of Mathematics, Sigma
We prove the correctness of the AKS algorithm [1] within the bounded arithmetic theory $T^{\text {count}}_2$ or, equivalently, the first-order consequences of the theory $\text {VTC}^0$ expanded by the smash function, which we denote by
Raheleh Jalali, Ondřej Ježil
doaj   +1 more source

Permutation polynomials over finite fields from a powerful lemma

open access: yes, 2011
Using a lemma proved by Akbary, Ghioca, and Wang, we derive several theorems on permutation polynomials over finite fields. These theorems give not only a unified treatment of some earlier constructions of permutation polynomials, but also new specific ...
Ding, Cunsheng   +3 more
core   +1 more source

Design, Control, and Clinical Applications of Magnetic Actuation Systems: Challenges and Opportunities

open access: yesAdvanced Intelligent Systems, Volume 7, Issue 3, March 2025.
This review aims to provide a broad understanding for interdisciplinary researchers in engineering and clinical applications. It addresses the development and control of magnetic actuation systems (MASs) in clinical surgeries and their revolutionary effects in multiple clinical applications.
Yingxin Huo   +3 more
wiley   +1 more source

A characterization and an explicit description of all primitive polynomials of degree two over finite fields [PDF]

open access: yes
For polynomials of degree two over finite fields, we present an improvement of Fitzgerald\u27s characterization (Finite Fields Appl. 9(1):117-121, 2003). We then use this new characterization to obtain an explicit, complete, and simple description of all
Vega, Gerardo
core   +1 more source

Home - About - Disclaimer - Privacy