Advances in Applied Mathematics
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Proceedings on Advances in cryptology---CRYPTO '86
A cryptographic library for the Motorola DSP56000
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A survey of fast exponentiation methods
Journal of Algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Survey of Hardware Implementation of RSA (Abstract)
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Elliptic Curve Cryptosystems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Software Implementation of the NIST Elliptic Curves Over Prime Fields
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Fast Elliptic Curve Multiplications with SIMD Operations
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Efficient Implementation of Elliptic Curve Cryptosystems on an ARM7 with Hardware Accelerator
ISC '01 Proceedings of the 4th International Conference on Information Security
ISC '02 Proceedings of the 5th International Conference on Information Security
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Montgomery Exponentiation with no Final Subtractions: Improved Results
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Fast Implementation of Elliptic Curve Defined over GF(pm) on CalmRISC with MAC2424 Coprocessor
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Design of secure cryptography against the threat of power-attacks in DSP-embedded processors
ACM Transactions on Embedded Computing Systems (TECS)
High-speed hardware implementations of Elliptic Curve Cryptography: A survey
Journal of Systems Architecture: the EUROMICRO Journal
Enhanced montgomery multiplication on DSP architectures for embedded public-key cryptosystems
EURASIP Journal on Embedded Systems - Embedded System Design in Intelligent Industrial Automation
Generalized Scalar Multiplication Secure against SPA, DPA, and RPA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient computations of the Tate pairing for the large MOV degrees
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Generalized MMM-algorithm secure against SPA, DPA, and RPA
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Efficient window-based scalar multiplication on elliptic curves using double-base number system
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
A fast RSA implementation on itanium 2 processor
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Efficient and secure elliptic curve point multiplication using double-base chains
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Efficient computation of tate pairing in projective coordinate over general characteristic fields
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
ISC'07 Proceedings of the 10th international conference on Information Security
A compact FPGA-based montgomery multiplier over prime fields
Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI
| Hi-index | 0.00 |
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 1024- bit RSA signing, 14.5 msec for 1024-bit DSA verification and 3.97 msec for 160-bit ECDSA verification.