Results 11 to 20 of about 17,255,193 (320)
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
Symposium on Field Programmable Gate Arrays, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
Fahmy, Suhaib A. +2 more
core +2 more sources
Mixing Additive and Multiplicative Masking for Probing Secure Polynomial Evaluation Methods
Transactions on Cryptographic Hardware and Embedded Systems, 2018 Masking is a sound countermeasure to protect implementations of block- cipher algorithms against Side Channel Analysis (SCA). Currently, the most efficient masking schemes use Lagrange’s Interpolation Theorem in order to represent any S- box by a ...
Axel Mathieu-Mahias, Michaël Quisquater
doaj +2 more sources
Verifiable Private Polynomial Evaluation [PDF]
Provable Security, 2017 Delegating the computation of a polynomial to a server in a verifiable way is challenging. An even more challenging problem is ensuring that this polynomial remains hidden to clients who are able to query such a server. In this paper, we formally define the notion of Private Polynomial Evaluation (PPE).
Bultel, Xavier +5 more
openaire +4 more sources
High‐performance SIMD modular arithmetic for polynomial evaluation [PDF]
Concurrency and Computation, 2020 Two essential problems in computer algebra, namely polynomial factorization and polynomial greatest common divisor computation, can be efficiently solved thanks to multiple polynomial evaluations in two variables using modular arithmetic. In this article,
Pierre Fortin +3 more
semanticscholar +1 more source
INTERPOL: Information Theoretically Verifiable Polynomial Evaluation [PDF]
International Symposium on Information Theory, 2019 We study the problem of verifiable polynomial evaluation in the user-server and multi-party setups. We propose INTERPOL, an information-theoretically verifiable algorithm that allows a user to delegate the evaluation of a polynomial to a server, and ...
Saeid Sahraei, A. Avestimehr
semanticscholar +1 more source
Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function ex
ACM Transactions on Mathematical Software, 2020 The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented.
Timothée Ewart +3 more
semanticscholar +1 more source
EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS [PDF]
International Journal of Algebra and Computation, 2006 By the fundamental theorem of symmetric polynomials, if P ∈ ℚ[X1,…,Xn] is symmetric, then it can be written P = Q(σ1,…,σn), where σ1,…,σn are the elementary symmetric polynomials in n variables, and Q is in ℚ[S1,…,Sn]. We investigate the complexity properties of this construction in the straight-line program model, showing that the complexity of ...
Pierrick Gaudry +2 more
openaire +3 more sources
Evaluating Fishing Capacity Based on DEA and Regression Analysis of China’s Offshore Fishery
Journal of Marine Science and Engineering, 2021 The analysis of offshore fishing capacity is of great significance and practical value to the sustainable utilization and conservation of marine fishery resources. Based on the 2004–2020 China Fishery Statistical Yearbook, data envelopment analysis (DEA)
Shuang Liu +4 more
doaj +1 more source
Systolic evaluation of polynomial expressions [PDF]
IEEE Transactions on Computers, 1990 Two types of organizations are presented for frame buffers of m*m pixels: one is a single wavefront complex cell array requiring O(m/sup 2/n) space and the other is a simple cell multiple wavefront array with O(m/sup 2/) area and O(n/sup 2/) wavefronts.
Mathias, PC, Patnaik, LM
openaire +2 more sources
Generalized monotone triangles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 In a recent work, the combinatorial interpretation of the polynomial $\alpha (n; k_1,k_2,\ldots,k_n)$ counting the number of Monotone Triangles with bottom row $k_1 < k_2 < ⋯< k_n$ was extended to weakly decreasing sequences $k_1 ≥k_2 ≥⋯≥k_n$.
Lukas Riegler
doaj +1 more source