Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201

Abstract

We propose new fast implementation method of public-key cryptography suitable for DSP. We improved modular multiplication and elliptic doubling to increase speed. For modular multiplication, we devised a new implementation method of Montgomery multiplication, which is suitable for pipeline processing. For elliptic doubling, we devised an improved computation for the number of multiplications and additions.We implemented RSA, DSA and ECDSA on the latest DSP (TMS320C6201, Texas Instruments), and achieved a performance of 11.7 msec for 1024bit RSA signing, 14.5 msec for 1024-bit DSA verification and 3.97 msec for 160-bit ECDSA verification.

On-the-Fly Multi-base Recoding for ECC Scalar Multiplication without Pre-computations

“…As future work, we plan to deal with more advanced recoding schemes to reduce the number of produced terms and improved randomization schemes to increase robustness against side-channel attacks. 11M + 5S 7M + 4S 3M + 5S 7M + 7S 11M + 11S 18M + 11S 28M + 15S [16], [31] 11M + 5S 7M + 4S 3M + 5S 7M + 8S 10M + 12S 14M + 15S n. a. curves references λDBL λTPL a = −3 [6], [11], [33] 4λM + (4λ + 2)S (11λ − 1)M + (4λ + 2)S curves references λTPL / λ ′ DBL a = −3…”

Hardware-Software Codesign of a Vector Co-processor for Public Key Cryptography

“…In [15], the authors present how modular multiplication based on Montgomery's method [18] can be implemented on a TMS320C6201 [26]. With their approach, a 1024-bit RSA verification (with e = 2 16 + 1) takes 1.2ms.…”

Efficient Computations of the Tate Pairing for the Large MOV Degrees

“…(Table 6) for a w-iterated ECDBL in the Jacobian coordinate [ITTTK99], which requires 4wM + (4w + 2)S.…”