AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
Matrix chain multiplication table3/13/2023 ![]() ![]() Comparison with implementations of the same function for other archi- tectures shows that the Cell Broadband Engine is competitive in terms of cost-performance ratio to other recent processors such as the Intel Core 2 for public-key cryptography. Furthermore we demonstrate that an implementation based on the multi- precision integer arithmetic functions provided by IBM's multi-precision math (MPM) library would take at least 2227040 cycles. ![]() This speed relies on a new representation of elements of the underlying finite field suited for the unconventional instruction set of this architec- ture. This cycle count is independent of inputs therefore protecting against timing attacks. We pre- sent a high-speed implementation of elliptic-curve Diffie-Hellman (ECDH) key exchange for this processor, which needs 697080 cycles on one Syn- ergistic Processor Unit for a scalar multiplication on a 255-bit elliptic curve, including the costs for key verification and key compression. Abstract: This paper is the first to investigate the power of the Cell Broadband Engine for state-of-the-art public-key cryptography.
0 Comments
Read More
Leave a Reply. |