Thesis Details
Montgomeryho násobení
This work discusses several Montgomery multplication algorithms. The Montgomery multiplication methods are keystone of the modular exponentiation operation, which is the most useful method used in public-key cryptography for encrypting and signing digital data.All of them have been proposed before. I describe and analyze the space and time requirements of all five algorithms. One of algorithms have been implemented in C. The analyses and performance results are presented in detail by Coarsely Integrated Operand Scanning (CIOS) method.
modular arithmetic, Montgomery multiplication, modular multiplication and exponentiation, public-key cryptography,RSA cryptosystems, Diffie-Hellman cryptosystems, EC-DSA cryptosystems, Digital Signiture Algorithm DSA.