Thesis Details

Montgomeryho násobení

Year Project Student: Pirkl Tomáš Academic Year: 2005/2006 Supervisor: Drábek Vladimír, doc. Ing., CSc.
English title
Montgomerry Multiplication
Language
Czech
Abstract

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.

Keywords

modular arithmetic, Montgomery multiplication, modular multiplication and exponentiation, public-key cryptography,RSA cryptosystems, Diffie-Hellman cryptosystems, EC-DSA cryptosystems, Digital Signiture Algorithm DSA.

Department
Degree Programme
Files
Status
defended
Date
10 May 2006
Citation
PIRKL, Tomáš. Montgomeryho násobení. Brno, 2006. Year Project. Brno University of Technology, Faculty of Information Technology. 2006-05-10. Supervised by Drábek Vladimír. Available from: https://www.fit.vut.cz/study/thesis/4960/
Back to top