Results 71 to 80 of about 648,267 (220)
Complexity bounds on Semaev’s naive index calculus method for ECDLP
Journal of Mathematical Cryptology, 2020 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
Gr\"obner-Shirshov bases for Rota-Baxter algebras [PDF]
, 2009 In this paper, we establish the Composition-Diamond lemma for associative nonunitary Rota-Baxter algebras with weight $\lambda$. As applications, we obtain a linear basis of a free commutative Rota-Baxter algebra without unity and show that every ...
Bokut, L. A., Chen, Yuqun, Deng, Xueming
core
Algebraic bases of some algebras of polynomials on Banach spaces
Математичні СтудіїThe work is devoted to the study of algebraic bases of algebras of continuous polynomials on real and complex Banach spaces. A subset of an algebra is called an algebraic basis if every element of the algebra can be uniquely represented as a linear ...
R. V. Ponomarov, T. V. Vasylyshyn
doaj +1 more source
The Goldman-Rota identity and the Grassmann scheme [PDF]
, 2013 We inductively construct an explicit (common) orthogonal eigenbasis for the elements of the Bose-Mesner algebra of the Grassmann scheme. The main step is a constructive, linear algebraic interpretation of the Goldman-Rota recurrence for the number of ...
Srinivasan, Murali K.
core
Idempotent vector spaces and their linear transformations
Concrete OperatorsThis article extends topics about linear algebra and operator theoretic linear transformations on complex vector spaces to those on bicomplex spaces.
Johnston William, Wahl Rebecca G.
doaj +1 more source
Gröbner Basis Cryptanalysis of Ciminion and Hydra
IACR Transactions on Symmetric CryptologyCiminion 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 +1 more source
Computation of Difference Grobner Bases [PDF]
Computer Science Journal of Moldova, 2012 This paper is an updated and extended version of our note \cite{GR'06} (cf.\ also \cite{GR-ACAT}). To compute difference \Gr bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet ...
Vladimir P. Gerdt, Daniel Robertz
doaj
EigenGP: Gaussian Process Models with Adaptive Eigenfunctions [PDF]
, 2015 Gaussian processes (GPs) provide a nonparametric representation of functions. However, classical GP inference suffers from high computational cost for big data. In this paper, we propose a new Bayesian approach, EigenGP, that learns both basis dictionary
Peng, Hao, Qi, Yuan
core
A minimal approach to the scattering of physical massless bosons
Journal of High Energy Physics, 2018 Tree and loop level scattering amplitudes which involve physical massless bosons are derived directly from physical constraints such as locality, symmetry and unitarity, bypassing path integral constructions.
Rutger H. Boels, Hui Luo
doaj +1 more source
Visualization approach in teaching process of linear algebra
, 2011 The aim of this study is to present a way of visualization to teaching and learning linear algebra at a level suitable for freshman and sophomore students.
A. Konyalıoglu +4 more
semanticscholar +1 more source