A designated cloud server-based multi-user certificateless public key authenticated encryption with conjunctive keyword search against IKGA

VB Chenam, ST Ali - Computer Standards & Interfaces, 2022 - Elsevier
With the massive growth of the World Wide Web (ie, internet), individual users or companies
can store and manage large amounts of sensitive data to outsource it to the cloud server …

Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis

WNAWM Ruzai, A Nitaj, MRK Ariffin, Z Mahad… - Computer Standards & …, 2022 - Elsevier
The public parameters of the RSA cryptosystem are represented by the pair of integers N
and e. In this work, first we show that if e satisfies the Diophantine equation of the form ex 2 …

Design and implementation of a secured SDN system based on hybrid encrypted algorithms

S Ghaly, MZ Abdullah - … Computing Electronics and Control), 2021 - telkomnika.uad.ac.id
Software defined network suggests centralizing network knowledge in one network portion
by separating the routing (control plane) mechanism from the transmission network packet …

Secure architecture for Cloud/Fog computing based on firewalls and controllers

F Kamoun-Abid, M Rekik, A Meddeb-Makhlouf… - Procedia Computer …, 2021 - Elsevier
The concept of distribution in the Cloud and Fog computing makes the network more
vulnerable to malicious activities. This requires use of distributed firewalls to stop incoming …

An optimal bound for factoring unbalanced RSA moduli by solving Generalized Implicit Factorization Problem

R Zhang, J Bi, L Li, H Peng - The Journal of Supercomputing, 2025 - Springer
The integer factorization problem, concerning the product of two primes N= pq, has been a
focal point for researchers since its rise to prominence with the RSA algorithm, a renowned …

Partial key exposure attack on RSA using some private key blocks

SK Ravva, K Prakash, SRM Krishna - Journal of Computer Virology and …, 2024 - Springer
RSA is a well-known cryptosystem in public-key cryptography and the strength of the
cryptosystem depends on the hardness of factoring large integers. Several attacks have …

Factoring the Modulus of Type N = p2q by Finding Small Solutions of the Equation er − (Ns + t) = αp2 + βq2

MA Asbullah, NNA Rahman, MRK Ariffin, NR Salim - Mathematics, 2021 - mdpi.com
The modulus of type N= p 2 q is often used in many variants of factoring-based
cryptosystems due to its ability to fasten the decryption process. Faster decryption is suitable …

Cryptanalysis of an additively homomorphic public key encryption scheme

Z Hong, L Zhou, Y Zhan, C Liu, B Wang - Computer Standards & Interfaces, 2022 - Elsevier
Based on the ElGamal cryptosystem, Bae et al.(J. Netw. Comput. Appl., vol. 59, pp. 333–344,
2016) proposed a new homomorphic encryption algorithm to reduce the network traffic and …

Side-channel information leakage analysis and countermeasures in an embedded CPU microarchitecture

Q Chen, D Zhao, L Liu, X Yan, Y Yuan, X Zhang… - Computer Standards & …, 2022 - Elsevier
Side-channel attacks (SCAs) have become a significant threat nowadays to cryptographic
devices, especially central processing units (CPUs). Based on the implementation of AES …

Cryptanalysis of common prime RSA with two decryption exponents: Jochemsz and May approach

SK Ravva, SRM Krishna - International Journal of …, 2023 - inderscienceonline.com
RSA is a well-known public key cryptosystem in modern-day cryptography. Common prime
RSA (CP-RSA) is a variant of RSA which is introduced by Wiener to avoid the small secret …