Highly-parallel montgomery multiplication for multi-core general-purpose microprocessors
S Baktir, E Savaş - Computer and Information Sciences III: 27th …, 2013 - Springer
Popular public key algorithms such as RSA and Diffie-Hellman key exchange, and more
advanced cryptographic schemes such as Paillier's and Damgård-Jurik's algorithms (with
applications in private information retrieval), require efficient modular multiplication with
large integers of size at least 1024 bits. Montgomery multiplication algorithm has proven
successful for modular multiplication of large integers. While general purpose multi-core
processors have become the mainstream on desktop as well as portable computers …
advanced cryptographic schemes such as Paillier's and Damgård-Jurik's algorithms (with
applications in private information retrieval), require efficient modular multiplication with
large integers of size at least 1024 bits. Montgomery multiplication algorithm has proven
successful for modular multiplication of large integers. While general purpose multi-core
processors have become the mainstream on desktop as well as portable computers …
[CITATION][C] Highly-Parallel Montgomery Multiplication for Multi-core General-Purpose Microprocessors, Department of Computer Engineering, Bahcesehir University …
S Baktri, E Savas
Showing the best results for this search. See all results