Staging Cryptographic Operations
Introduction
In this project we study improving
the performance of cryptographic operations by staging.
Cryptography has been used extensively, yet it has the drawback
of being computationally expensive, and often becomes the bottleneck
of the system.
We observed that many secure systems have the property that the
secret keys are relatively stable. In other words, the same key
is used repeatedly. Thus, cryptographic operations fixed
with some secret key seem to have a large potential for staging.
Progress
- Oct 9: progress report
- Oct 27:
- Created a homepage for the project :)
- Reimplemented all functions using internal library Big_int.
- Tested for correctness with long (128-bit) keys.
- CRT version now performs better than non-CRT version, probably due to longer keys.
- Initial experimental result is encouraging. Some 30% improvement.
- Nov 11:
- Implemented Rabin and ElGamal algorithms. Verified correctness.
- Nov 13:
- Implemented batching [Proc. Crypto'89 p.175, Proc. RSA'01 p.28] to speed up RSA decryption.
- Dec 13:
Last modified: