On finiteness theorems of polynomial functions

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...

On Sandwich theorems for certain classes of analytic functions

The purpose of this present paper is to derive some subordination and superordination results for certain analytic functions in the open unit disk. Relevant connections of the results, which are presented in the paper, with various known results are also considered.

Finiteness Analysis in Polynomial Time

q-Taylor theorems, polynomial expansions, and interpolation of entire functions

We establish q-analogues of Taylor series expansions in special polynomial bases for functions analytic in bounded domains and for entire functions whose maximum modulus Mðr; f Þ satisfies jln Mðr; f ÞjpA ln r: This solves the problem of constructing such entire functions from their values at 1⁄2aq þ q =a =2; for 0oqo1: Our technique is constructive and gives an explicit representation of the s...

On Ritt’s Polynomial Decomposition Theorems

Ritt studied the functional decomposition of a univariate complex polynomial f into prime (indecomposable) polynomials, f = u1 ◦ u2 ◦ · · · ◦ ur. His main achievement was a procedure for obtaining any decomposition of f from any other by repeatedly applying certain transformations. However, Ritt’s results provide no control on the number of times one must apply the basic transformations, which ...