In this paper, we proposed an idea to construct a general multivariate public key cryptographic (MPKC) scheme based on a user’s identity. In our construction, each user is distributed a unique identity by the key distribution center (KDC) and we use this key to generate user’s private keys. Thereafter, we use these private keys to produce the corresponding public key. This method can make key generating process easier so that the public key will reduce from dozens of Kilobyte to several bits. We then use our general scheme to construct practical identity-based signature schemes named ID-UOV and ID-Rainbow based on two well-known and promising MPKC signature schemes, respectively. Finally, we present the security analysis and give experiments for all of our proposed schemes and the baseline schemes. Comparison shows that our schemes are both efficient and practical.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

Let ϕ be an analytic function defined on the unit disk$D$, with ϕ($D$)⊂$D$, ϕ(0)=0, and ϕ′(0)=λ≠0. Then by a classical result of G. Kœnigs, the sequence of normalized iterates Φ_{$n$}/λ^{$n$}converges uniformly on compact subsets of$D$to a function σ analytic in$D$which satisfies$σ$°φ=λ$σ$. It is of interest in the study of composition operators to know if, whenever σ belongs to a Hardy space$H$_{$p$}, the sequence Φ_{$n$}/λ^{$n$}converges to σ in the norm of$H$_{$p$}. We show that this is indeed the case, generalizing a result of P. Bourdon obtained under the assumption that ϕ is univalent.