Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Muhammad Asyraf Asbullah"'
Autor:
Wan Nur Aqlili Ruzai, You Ying, Khairun Nisak Muhammad, Muhammad Asyraf Asbullah, Muhammad Rezal Kamel Ariffin
Publikováno v:
AIMS Mathematics, Vol 9, Iss 10, Pp 28211-28231 (2024)
The Rivest-Shamir-Adleman (RSA) algorithm is a widely utilized technique in asymmetric cryptography, primarily for verifying digital signatures and encrypting messages. Its security relies on the integer factorization problem's difficulty, which is c
Externí odkaz:
https://doaj.org/article/8630e31f86044eba94a795c9ca0b4a65
Autor:
Wan Nur Aqlili Ruzai, Muhammad Rezal Kamel Ariffin, Muhammad Asyraf Asbullah, Amir Hamzah Abd Ghafar
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 36, Iss 5, Pp 102074- (2024)
RSA stands as a widely adopted method within asymmetric cryptography, commonly applied for digital signature validation and message encryption. The security of RSA relies on the challenge of integer factorization, a problem considered either computat
Externí odkaz:
https://doaj.org/article/88acc6d0f15140b78829516127f02102
Autor:
Wan Nur Aqlili Ruzai, Muhammad Rezal Kamel Ariffin, Muhammad Asyraf Asbullah, Zahari Mahad, Athirah Nawawi
Publikováno v:
IEEE Access, Vol 8, Pp 80997-81006 (2020)
Let N = pq be an RSA modulus where p and q are primes not necessarily of the same bit size. Previous cryptanalysis results on the difficulty of factoring the public modulus N = pq deployed on variants of RSA cryptosystem are revisited. Each of these
Externí odkaz:
https://doaj.org/article/787ffefdca444b3aa2de92dbc9f01ec8
Autor:
Nurul Nur Hanisah Adenan, Muhammad Rezal Kamel Ariffin, Faridah Yunos, Siti Hasana Sapar, Muhammad Asyraf Asbullah
Publikováno v:
PLoS ONE, Vol 16, Iss 3, p e0248888 (2021)
This paper presents a cryptanalytic approach on the variants of the RSA which utilizes the modulus N = p2q where p and q are balanced large primes. Suppose [Formula: see text] satisfying gcd(e, ϕ(N)) = 1 where ϕ(N) = p(p - 1)(q - 1) and d < Nδ be
Externí odkaz:
https://doaj.org/article/80fad9566f9049bca129ccb1a5f91bcf
Autor:
Muhammad Asyraf Asbullah, Normahirah Nek Abd Rahman, Muhammad Rezal Kamel Ariffin, Nur Raidah Salim
Publikováno v:
Mathematics, Vol 9, Iss 22, p 2931 (2021)
The modulus of type N=p2q is often used in many variants of factoring-based cryptosystems due to its ability to fasten the decryption process. Faster decryption is suitable for securing small devices in the Internet of Things (IoT) environment or sec
Externí odkaz:
https://doaj.org/article/5e5ef54cbe1c42108cb03ac6701886d7
Autor:
Boon Chian Tea, Muhammad Rezal Kamel Ariffin, Amir Hamzah Abd. Ghafar, Muhammad Asyraf Asbullah
Publikováno v:
Mathematics, Vol 9, Iss 21, p 2642 (2021)
Boneh et al. introduced mediated RSA (mRSA) in 2001 in an attempt to achieve faster key revocation for medium-sized organizations via the involvement of a security mediator (SEM) as a semi-trusted third party to provide partial ciphertext decryption
Externí odkaz:
https://doaj.org/article/5006ff59f48f4e22a3acecacb3f7a20e
Publikováno v:
Mathematics, Vol 9, Iss 18, p 2226 (2021)
Matrix inversion is one of the most significant operations on a matrix. For any non-singular matrix A∈Zn×n, the inverse of this matrix may contain countless numbers of non-integer entries. These entries could be endless floating-point numbers. Sto
Externí odkaz:
https://doaj.org/article/fc2353bc31244a5fa6425b8ef638eb0e
Autor:
Rasyid Redha Mohd Tahir, Muhammad Asyraf Asbullah, Muhammad Rezal Kamel Ariffin, Zahari Mahad
Publikováno v:
Symmetry, Vol 13, Iss 5, p 735 (2021)
Fermat’s Factoring Algorithm (FFA) is an integer factorisation methods factoring the modulus N using exhaustive search. The appearance of the Estimated Prime Factor (EPF) method reduces the cost of FFA’s loop count. However, the EPF does not work
Externí odkaz:
https://doaj.org/article/b8fb681bdcb34d2ab9d93e442f6ffbae
Autor:
Nurul Nur Hanisah Adenan, Muhammad Rezal Kamel Ariffin, Siti Hasana Sapar, Amir Hamzah Abd Ghafar, Muhammad Asyraf Asbullah
Publikováno v:
Mathematics, Vol 9, Iss 4, p 340 (2021)
This paper describes an attack on the Rivest, Shamir and Adleman (RSA) cryptosystem utilizing the modulus N=p2q where p and q are two large balanced primes. Let e1,e2
Externí odkaz:
https://doaj.org/article/ec137d38a9ce4cce89c4e3e90a22e422
Autor:
Hayder Natiq, Muhammad Rezal Kamel Ariffin, Muhammad Asyraf Asbullah, Zahari Mahad, Mohammed Najah
Publikováno v:
Entropy, Vol 23, Iss 1, p 48 (2020)
The present work introduces an analysis framework to comprehend the dynamics of a 3D plasma model, which has been proposed to describe the pellet injection in tokamaks. The analysis of the system reveals the existence of a complex transition from tra
Externí odkaz:
https://doaj.org/article/5af99ee078b14b6ba2c2ae251b615e05