Abstract
With the rapid advance in wired and wireless communication, many applications, e.g., ECommerce and credit card transaction system, have become more and more popular. Using cryptographic algorithms to protect private and sensitive information on the public network therefore becomes an essential measure. Generally speaking, the software implementation of public-key cryptographic algorithms can not satisfy the high throughput requirements. The hardware approach which has better throughput and supports scalable key size is thus desirable. In this thesis, we propose a mesh-structured multi-cell multiplier which can support scalable key length for most public-key cryptographic algorithms. The design of multi-cell multiplier is based on a word-based Montgomery multiplication algorithm. The congurable cell array architecture can efciently address multiple tasks of different key sizes in parallel. When performing a long modular multiplication, e.g., 2048-bit, multiple cells are congured together to accelerate the computation, where the input operands are averagely stored in these cells, sharing the memory resources as well. The regular mesh-structured architecture facilitates the physical implementation. Moreover the recongurable scheme provides a high exibility in the tradeoff between performance and silicon area. Based on the proposed architecture, we implement an array of sixteen cells, which can support the key size up to 4096-bit. The mesh-structured cell array is synthesized using 0.13μm cell library, which can achieve the throughput of 84.1Kbps for 1024-bit RSA, 21Kbps for 2048-bit RSA, and 5.2Kbps for 4096-bit RSA at a 181MHz clock frequency.