The bottleneck in the proving algorithm of most elliptic-curve-based SNARK proof systems is Multi-Scalar-Multiplication (MSM) algorithm. In this paper we give an overview a variant Pippenger MSM together with set optimizations tailored for curves that admit twisted Edwards form. We prove case SNARK-friendly chains and cycles elliptic curves, which are useful recursive constructions. Our contrib...

For Banach algebras A in a class which includes all group and function algebras, we show that the family of ideals of A with the same hull is typically quite large, containing ascending and descending chains of arbitrary length through any ideal in the family, and that typically a closed ideal of A whose hull meets the Silov boundary of A cannot be countably generated algebraically. Guided by t...

let $r$ be a commutative ring and let $m$ be an $r$-module. we define the small intersection graph $g(m)$ of $m$ with all non-small proper submodules of $m$ as vertices and two distinct vertices $n, k$ are adjacent if and only if $ncap k$ is a non-small submodule of $m$. in this article, we investigate the interplay between the graph-theoretic properties of $g(m)$ and algebraic properties of $m...

Following Buchberger's approach to computing a Grr obner basis of a polynomial ideal in polynomial rings, a completion procedure for nitely generated right ideals in ZH] is given, where H is an ordered monoid presented by a nite, convergent semi{Thue system ((; T). Taking a nite set F ZH] we get a (possibly innnite) basis of the right ideal generated by F , such that using this basis we have un...

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest of which remains the Pollard rho algorithm with r-adding walks. For the first time, we rigorously analyze the Pollard rho method with r-addin...

Exploiting the analogy between exemplar models and population coding schemes, we characterize, by means of information theoretic tools, the efficiency of a large but finite population of cells coding for a discrete set of categories (e.g. vowels). The optimal code is shown to typically allocate more cells to class boundaries than to regions further apart. We then discuss the predicted perceptua...

We consider the problem of designing reliable and confidential lattice codes, known as wiretap lattice codes, for fast fading channels. We identify as code design criterion for finite lattice constellations a finite sum of inverse of algebraic norms, in fact the analogous for finite sums of the known criterion for infinite constellations, which motivates us to study totally real number fields w...

Pregnancy and delivery is one of the main causes in the female body weight alteration, especially with obesity. This alteration in body weight has a significant effect not only for a femine beauty standpoint, but also for more important reproductive functions in postpartum. For the actual condition of the maternal body weight alteration and its clinical significance, we made the various analysi...

If R is a 2-sided fir (free ideal ring) with no non-trivial right invariant elements, we shall find that the non-zero 2-sided ideals of R, under the usual multiplication of ideals, form a free semigroup with 1. In particular, this holds when R is a free associative algebra over a field. (We also consider the operations of multiplying right ideals by 2-sided ideals to get right ideals, 2-sided i...