Citation
Chang, Boon Chiao and Goi, Bok Min and Phan, Raphael and Lee, Wai Kong (2018) Multiplying very large integer in GPU with pascal architecture. In: 2018 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE), 28-29 April 2018, Penang, Malaysia.
Text
42.pdf - Published Version Restricted to Repository staff only Download (1MB) |
Official URL: https://ieeexplore.ieee.org/document/8405506
Abstract
Multiplication plays an important role in scientific computing and cryptography. When the size of multiplicands grow large (e.g. more than 100K-bit), the multiplication process become time consuming. In this paper, we present implementation techniques to multiply very large integer in state of the art GPU architecture. The implementation relies on Number Theoretic Transform with 64-bit prime. The implementation results show that multiplication of 768K-bit integer takes 1.37 milliseconds on GTX1070 (GPU with Pascal architecture). The work presented in this paper can be used to implement various advanced cryptosystem, including Homomorphic Encryption and Lattice based cryptography
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Uncontrolled Keywords: | Finite element |
Subjects: | T Technology > TA Engineering (General). Civil engineering (General) > TA329-348 Engineering mathematics. Engineering analysis |
Divisions: | Faculty of Engineering (FOE) |
Depositing User: | Ms Rosnani Abd Wahab |
Date Deposited: | 04 Apr 2021 21:45 |
Last Modified: | 04 Apr 2021 21:45 |
URII: | http://shdl.mmu.edu.my/id/eprint/7612 |
Downloads
Downloads per month over past year
Edit (login required) |