An improved Montgomery's algorithm for high-speed RSA public-key cryptosystem

1999 ◽  
Vol 7 (2) ◽  
pp. 280-284 ◽  
Author(s):  
Chih-Yuang Su ◽  
Shih-Am Hwang ◽  
Po-Song Chen ◽  
Cheng-Wen Wu
2012 ◽  
Vol 236-237 ◽  
pp. 1139-1144
Author(s):  
Wu Yan Fang ◽  
Zheng Huang ◽  
Wang Li Cheng ◽  
Wen Qiao Yan

Since the presentation of NTRU public-key cryptosystem by Hoffstein, Pipher and Silverman, its favorable properties, such as easily created keys, high speed, excellent performance and conjectured resistance to quantum computers, have made it to be of great use. This paper proposes an enhanced scheme based on the hard learning with error over ring (R-LWE) problem to improve the security of the modified NTRUEncrypt presented by Stehle and Steinfled. We used part of the padding ideas of Fujisaki and Okamoto to obtain this scheme. It is semantically secure in strong sense of indistinguishability against adaptive chosen-ciphertext attacks in the random oracle model assuming the quantum hardness of standard worst-case problem over ideal lattices. It is also possible to arbitrarily decrease the error probability, and even to eliminate it completely. We gave the detailed analysis using the known results from classic works. Furthermore, this scheme owns many advantages such as the uniformity of public key, usual assumptions and the freedom for coding messages.


Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI

2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena

2009 ◽  
Vol 3 (4) ◽  
Author(s):  
Simon R. Blackburn ◽  
Carlos Cid ◽  
Ciaran Mullan

Sign in / Sign up

Export Citation Format

Share Document