Book
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification.
Title: | Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification. |
---|---|
Authors: | Möller, Bodo, Rupp, Andy |
Source: | Security & Cryptography for Networks (9783540858546); 2008, p39-56, 18p |
Abstract: | When verifying digital signatures, achieving a high throughput can be crucial. We present a technique that is useful for ECDSA and DSA signatures. It assumes that common domain parameters are used (which is typical of ECDSA) and that at least some signers recur (as in many application scenarios). We can achieve noticeable speedups in very different environments– from highly restricted ones where memory is very scarce to larger machines without severe memory restrictions. Requirements for the target platform are very small for a beneficial application of our technique. This makes it attractive for embedded systems, where ECDSA is a signature scheme of choice. More generally, what we consider is the task of computing power products ]> (˵multi-exponentiation″) where base elements g |
Copyright of Security & Cryptography for Networks (9783540858546) is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
DOI: | 10.1007/978-3-540-85855-3_4 |
Database: | Complementary Index |
Availability