scholarly journals MODULAR COMPUTATION FOR MATRICES OF ORE POLYNOMIALS

Author(s):  
HOWARD CHENG ◽  
GEORGE LABAHN
Author(s):  
Debasish Chakroborti ◽  
Banani Roy ◽  
Amit Mondal ◽  
Golam Mostaeen ◽  
Chanchal K. Roy ◽  
...  

2013 ◽  
Vol 46 (3/4) ◽  
pp. 106-107
Author(s):  
George Labahn ◽  
Johannes Middeke

2018 ◽  
Vol 20 (1) ◽  
pp. 013004 ◽  
Author(s):  
Jayne Thompson ◽  
Kavan Modi ◽  
Vlatko Vedral ◽  
Mile Gu

2015 ◽  
Vol 49 (1) ◽  
pp. 24-24
Author(s):  
Maximilian Jaroschek
Keyword(s):  

2011 ◽  
Vol 135-136 ◽  
pp. 187-191
Author(s):  
Peng Sheng Gu ◽  
Jia Ming He ◽  
Ling Hui Fan

For the limited calculation of mobile device, the difficulty of finding big prime number and the complexity of RSA exponential modular computation, this paper proposes a modified algorithm to find prime numbers in the RSA algorithm. It modifies the method of random numbers generation to improve the efficiency of pre-screening algorithm. To reduce the terminal calculation and accelerate the speed of key-pair generation, it transfers the most time-consuming operation of big prime number modular exponentiation to the servers. Based on the key-pair generation algorithm, this paper finally proposes a terminal registration scheme of mobile payment.


Sign in / Sign up

Export Citation Format

Share Document