Faster and smaller hardware implementation of XTR
(2006) Advanced Signal Processing Algorithms, Architectures, and Implementations XVI — Location: San Diego, CA, USA
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- Modular multiplication is the core of most public key cryptosystems and therefore its implementation plays a crucial role in the overall efficiency of asymmetric cryptosystems. Hardware approaches provide advantages over software in the framework of efficient dedicated accelerators. The concerns of the designers are mainly the die size, frequency, latency (throughput) and power consumption of those solutions. We show in this paper how booth recoding, pipelining, Montgomery modular multiplication and carry save adders offer an attractive solution for hardware modular multiplication. Although most of the hereafter techniques stand as state-of-the-art, the combination described here is unique and particularly efficient in the context of constrained hardware design of XTR cryptosystem. Our solution is implemented on an FPGA platform and compared with previous results. The area-time ratio is improved by around a factor of 3.
- Affiliations
Citations
Nève, M., Quisquater, J.-J., Peeters, E., & De Dormale, G. M. (2006). Faster and smaller hardware implementation of XTR. Advanced Signal Processing Algorithms, Architectures, and Implementations XVI, Vol. 6313, p. 631309-1-631309-631309-12. https://doi.org/10.1117/12.680441