A new public-key encryption scheme based on LUCas sequence

2005 ◽  
Vol 22 (5) ◽  
pp. 490-497
Author(s):  
Zhengtao Jiang ◽  
Yanhua Hao ◽  
Yumin Wang
2020 ◽  
Vol 14 (1) ◽  
pp. 218-223
Author(s):  
Jean-Sébastien Coron ◽  
Agnese Gini

AbstractAt Crypto 2018, Aggarwal, Joux, Prakash and Santha (AJPS) described a new public-key encryption scheme based on Mersenne numbers. Shortly after the publication of the cryptosystem, Beunardeau et al. described an attack with complexity 𝓞(22h). In this paper, we describe an improved attack with complexity 𝓞(21.75h).


2007 ◽  
Vol 22 (1) ◽  
pp. 95-102 ◽  
Author(s):  
Hai-Bo Tian ◽  
Xi Sun ◽  
Yu-Min Wang

2011 ◽  
Vol 5 (7) ◽  
pp. 809-822 ◽  
Author(s):  
Ping Pan ◽  
Lihua Wang ◽  
Licheng Wang ◽  
Lixiang Li ◽  
Yixian Yang

Informatica ◽  
2012 ◽  
Vol 23 (4) ◽  
pp. 537-562 ◽  
Author(s):  
Ting-Yi Chang ◽  
Min-Shiang Hwang ◽  
Wei-Pang Yang

2009 ◽  
Vol 20 (10) ◽  
pp. 2907-2914 ◽  
Author(s):  
Liao-Jun PANG ◽  
Hui-Xian LI ◽  
Li-Cheng JIAO ◽  
Yu-Min WANG

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.


Sign in / Sign up

Export Citation Format

Share Document