Download Now Free registration required
With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the computational requirements of public-key cryptosystems are often beyond the constraints embedded processors are bound to. This is especially true for cryptosystems that make heavy use of modular exponentiation like the Direct Anonymous Attestation scheme. The most popular algorithm for modular exponentiation is the Montgomery exponentiation based on sliding window technology. This technology offers several configuration options in order to get the best trade-off between the amount of pre-computations and multiplications that are required for different exponentiation operands.
- Format: PDF
- Size: 117.57 KB