Tiled architectures are emerging as an architectural plat- form that allows high levels of instruction level parallelism. Traditional compiler parallelization techniques are usu- ally employed to generate programs for these architectures. However, for specific application domains, the compiler is not able to effectively exploit the domain knowledge. In this paper, we propose a new programming model that, by means of the definition of software function units, allows domain-specific features to be explicitly modeled, achieving good performances while reducing development times with respect to low-level programming. Identity-based crypto- graphic algorithms are known to be computationally inten- sive and difficult to parallelize automatically. Recent ad- vances have led to the adoption of embedded cryptographic coprocessors to speed up both traditional and identity- based public key algorithms. Custom-designed coproces- sors have high development costs and times with respect to general purpose or DSP coprocessors. Therefore, the pro- posed methodology can be effectively employed to reduce time to market while preserving performances. It also rep- resents a starting point for the definition of cryptography- oriented programming languages. We prove that tiled ar- chitecture well compare w.r.t. competitors implementations such as StrongARM and FPGAs.