Iterative methods based on small functions are used both to show local surjectivity of certain operators and a fixed point property of mappings on scales of complete metric spaces.

In this paper, we investigate the uniqueness problem of differential–difference polynomials $$(f^{n}(z)P(f)L_c(f))^{(k)}$$ and $$(g^{n}(z)P(g)L_c(g))^{(k)}$$ sharing a small function under notion weakly weighted relaxed sharing, where $$L_c(f)=f(z+c)+c_0f(z)$$ , P(z) is polynomial with constant coefficients degree m, obtained corresponding results, which improve extend some recent results due t...

We explore the idea of creating a hash function that produces an s-bit digest from a compression function with an n-bit output, where s > n. This is accomplished by truncating a hash function with a digest size of ln-bits. Our work answers the question of how large l can be while creating a digest of sn-bits securely. We prove that our construction is secure with respect to preimage resistance ...