Generalized Combinatoric Accumulator
نویسندگان
چکیده
منابع مشابه
On a Combinatoric Conjecture
Recently, Tu and Deng [1] proposed a combinatorial conjecture on binary string, on the premise that the conjecture is correct they obtain two classes of Boolean functions which are both algebraic immunity optimal: the first class of functions are also bent. The second class are balanced functions, which have optimal algebraic degree and the best nonlinearity up to now. In this paper, from three...
متن کاملA Combinatoric Proof and Generalization of Ferguson’s Formula for k-generalized Fibonacci Numbers
Various generalizations of the Fibonacci numbers have been proposed, studied and applied over the years (see [5] for a brief list). Probably the best known are the k-generalized Fibonacci numbers F (k) n (also known as the k-fold Fibonacci, k-th order Fibonacci, k-Fibonacci or polynacci numbers), satisfying F (k) n = F (k) n−1 + F (k) n−2 + . . .+ F (k) n−k , n ≥ k , F (k) n = 0 , 0 ≤ n ≤ k − 2...
متن کاملAnalytic and combinatoric aspects of Hurwitz polyzêtas
Résumé. Dans ce travail, un codage symbolique des séries génératrices de Dirichlet généralisées est obtenu par les techniques combinatoires des séries formelles en variables non-commutative. Il permet d’expliciter les séries génératrices de Dirichlet généralisées ’périodiques’ – donc notamment les polyzêtas colorés – comme combinaison linéaire de polyzêtas de Hurwitz. De plus, la version non co...
متن کاملFloating accumulator architecture
Although technology advancement can pack more and more physical registers in processors, the numbers of architectured registers defined by the instruction set architectures (ISAs) remain relatively small on most modern processors. Exposing more architectured registers to compilers and programmers can improve the effectiveness of compiler optimization and the quality of code. However, increasing...
متن کاملCompact Accumulator Using Lattices
An accumulator is a succinct aggregate of a set of values where it is possible to issue short membership proofs for each accumulated value. A party in possession of such a membership proof can then demonstrate that the value is included in the set. In this paper, we preset the first lattice-based accumulator scheme that issues compact membership proofs. The security of our scheme is based on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2008
ISSN: 0916-8532,1745-1361
DOI: 10.1093/ietisy/e91-d.5.1489