Mustafa Al-Fayoumi - Academia.edu (original) (raw)

Related Authors

Steven Pinker

David Seamon

Armando Marques-Guedes

Paul Tobin

Fabio Cuzzolin

Roshan Chitrakar

Lev Manovich

Lev Manovich

Graduate Center of the City University of New York

Bogdan Gabrys

PALIMOTE JUSTICE

Bálint Molnár

Uploads

Papers by Mustafa Al-Fayoumi

Research paper thumbnail of A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks

Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile N... more Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks Mustafa Al-Fayoumi , Shadi Nashwan, Sufian Yousef, *Abdel-Rahman Alzoubaidi Anglia Ruskin University, Chelmsford-UK Al-Zaytoonah University, Amman-Jordan ...

Research paper thumbnail of A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks

Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile N... more Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks Mustafa Al-Fayoumi , Shadi Nashwan, Sufian Yousef, *Abdel-Rahman Alzoubaidi Anglia Ruskin University, Chelmsford-UK Al-Zaytoonah University, Amman-Jordan ...

Research paper thumbnail of An Efficient RSA Public Key Encryption Scheme

In this paper, we propose an efficient RSA public key encryption scheme, which is an improved ver... more In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h h u square matrices with entities in n z indicated via ) , ( n z h l . Since the original RSA Scheme is a block cipher in which the original message and cipher message are integer in the interval ] 1 , 0 [ n for some integer modulus n .Therefore, in this paper, we generalize RSA encryption scheme in order to be implemented in the general linear group on the ring of integer mod n . Furthermore, the suggested encryption scheme has no restriction in encryption and decryption order and is claimed to be efficient, scalable and dynamic.

Research paper thumbnail of A New Digital Signature Scheme Based on Integer Factoring and Discrete Logarithm Problem

International Journal of Computers and Their Applications, 2010

A new idea for digital signature scheme is suggested. The suggested scheme employs a composite mo... more A new idea for digital signature scheme is suggested. The suggested scheme employs a composite modulus that is a product of two distinct prime numbers. There is a similarity with the most widely used digital signature schemes such as RSA regarding the algebraic background. The new scheme uses operations in prime integer order, a characteristic that is similar to Digital Signature Standard ( DSS ) scheme. Thus the proposed signature scheme is deterministic. The new scheme is competitive and more efficient in time complexity compared with DSS and RSA schemes regarding measurement over both key generation and key verification.

Research paper thumbnail of A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks

Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile N... more Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks Mustafa Al-Fayoumi , Shadi Nashwan, Sufian Yousef, *Abdel-Rahman Alzoubaidi Anglia Ruskin University, Chelmsford-UK Al-Zaytoonah University, Amman-Jordan ...

Research paper thumbnail of A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks

Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile N... more Page 1. A New Hybrid Approach of Symmetric/Asymmetric Authentication Protocol for Future Mobile Networks Mustafa Al-Fayoumi , Shadi Nashwan, Sufian Yousef, *Abdel-Rahman Alzoubaidi Anglia Ruskin University, Chelmsford-UK Al-Zaytoonah University, Amman-Jordan ...

Research paper thumbnail of An Efficient RSA Public Key Encryption Scheme

In this paper, we propose an efficient RSA public key encryption scheme, which is an improved ver... more In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h h u square matrices with entities in n z indicated via ) , ( n z h l . Since the original RSA Scheme is a block cipher in which the original message and cipher message are integer in the interval ] 1 , 0 [ n for some integer modulus n .Therefore, in this paper, we generalize RSA encryption scheme in order to be implemented in the general linear group on the ring of integer mod n . Furthermore, the suggested encryption scheme has no restriction in encryption and decryption order and is claimed to be efficient, scalable and dynamic.

Research paper thumbnail of A New Digital Signature Scheme Based on Integer Factoring and Discrete Logarithm Problem

International Journal of Computers and Their Applications, 2010

A new idea for digital signature scheme is suggested. The suggested scheme employs a composite mo... more A new idea for digital signature scheme is suggested. The suggested scheme employs a composite modulus that is a product of two distinct prime numbers. There is a similarity with the most widely used digital signature schemes such as RSA regarding the algebraic background. The new scheme uses operations in prime integer order, a characteristic that is similar to Digital Signature Standard ( DSS ) scheme. Thus the proposed signature scheme is deterministic. The new scheme is competitive and more efficient in time complexity compared with DSS and RSA schemes regarding measurement over both key generation and key verification.

Log In