Syeda Wajiha Zahra¹, Muhammad Nadeem², Ali Arshad^3,*, Saman Riaz³, Muhammad Abu Bakr⁴, Ashit Kumar Dutta⁵, Zaid Alzaid⁶, Badr Almutairi⁷, Sultan Almotairi⁸

CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 589-616, 2024, DOI:10.32604/cmc.2023.042386

Abstract Various organizations store data online rather than on physical servers. As the number of user’s data stored in cloud servers increases, the attack rate to access data from cloud servers also increases. Different researchers worked on different algorithms to protect cloud data from replay attacks. None of the papers used a technique that simultaneously detects a full-message and partial-message replay attack. This study presents the development of a TKN (Text, Key and Name) cryptographic algorithm aimed at protecting data from replay attacks. The program employs distinct ways to encrypt plain text [P], a user-defined Key [K], and a Secret Code… More >

Wunan Wan^1,*, Jun Chen¹, Jinyue Xia², Jinquan Zhang¹, Shibin Zhang¹, Hao Chen¹

Computer Systems Science and Engineering, Vol.36, No.2, pp. 417-434, 2021, DOI:10.32604/csse.2021.014460

Abstract In this paper, we propose two new attack algorithms on RSA implementations with CRT (Chinese remainder theorem). To improve the attack efficiency considerably, a clustering collision power attack on RSA with CRT is introduced via chosen-message pairs. This attack method is that the key parameters d_p and d_q are segmented by byte, and the modular multiplication collisions are identified by k-means clustering. The exponents d_p and d_q were recovered by 12 power traces of six groups of the specific message pairs, and the exponent d was obtained. We also propose a second order clustering collision power analysis attack against RSA… More >