Results 11 to 20 of about 3,441,413 (166)
Gröbner Basis Cryptanalysis of Ciminion and Hydra [PDF]
Ciminion and Hydra are two recently introduced symmetric key Pseudo- Random Functions for Multi-Party Computation applications. For efficiency, both primitives utilize quadratic permutations at round level.
Matthias Johann Steiner
doaj +2 more sources
The Role of Meprins on the Brain Extracellular Matrix and Perineuronal Nets. [PDF]
Meprin β overexpression is implicated in Alzheimer's Disease. Recent studies identified brevican as a meprin β substrate, and this study demonstrates that meprin α co‐expression enhances meprin β‐mediated brevican cleavage. Further, neurocan and RPTPζ were identified as novel meprin β substrates in an N‐terminomics analysis of meprin β transgenic mice,
Kreiselmaier S +13 more
europepmc +2 more sources
Weyl Gröbner Basis Cryptosystems [PDF]
In this thesis, we shall consider a certain class of algebraic cryptosystems called Gröbner Basis Cryptosystems. In 1994, Koblitz introduced the Polly Cracker cryptosystem that is based on the theory of Gröbner basis in commutative polynomials rings. The
Ali, Rashid
core +2 more sources
Computing Minimal Generating Sets of Invariant Rings of Permutation Groups with SAGBI-Gröbner Basis [PDF]
We present a characteristic-free algorithm for computing minimal generating sets of invariant rings of permutation groups. We circumvent the main weaknesses of the usual approaches (using classical Gröbner basis inside the full polynomial ring, or pure ...
Nicolas Thiéry
doaj +1 more source
Oracle-supported drawing of the Gröbner escalier
The aim of this note is to discuss the following quite queer problem: to compute the Gröbner basis of an ideal I w.r.t. a term-ordering ≺ without knowing neither the ideal nor the term-ordering but only a degree bound of the required Gröbner basis, being
Maria Emilia Alonso +2 more
doaj +1 more source
Complexity bounds on Semaev’s naive index calculus method for ECDLP
Since Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as ...
Yokoyama Kazuhiro +3 more
doaj +1 more source
Solving systems of algebraic equations is presented using the Gröbner Basis Package of the computer algebra system MAPLE V. The Grobner basis computations allow exact conclusions on the solutions of sets of polynomial equations, such as to decide if the
György Popper
doaj
Elevating PGBMain algorithm performance through strategic minimal Dickson basis selection [PDF]
In this paper, we enhance the PGBMain algorithm, an efficient method for computing Gröbner bases of parametric polynomial ideals, or Gröbner systems. A key step in the PGBMain algorithm involves computing a minimal Dickson basis in each iteration, which ...
Mahdi Dehghani Darmian
doaj +1 more source
A Robust Visual Localization Method With Unknown Focal Length Camera
PnP problem is well researched in many fields, such as computer vision. It is considered the fundamental method to solve the key problems of robot SLAM.
Xiliang Yin +3 more
doaj +1 more source
Computing Independent Variable Sets for Polynomial Ideals
Computing independent variable sets for polynomial ideals plays an important role in solving high-dimensional polynomial equations. The computation of a Gröbner basis for an ideal, with respect to a block lexicographical order in classic methods, is huge,
Zhuoran Yang, Chang Tan
doaj +1 more source

